





from typing import TYPE_CHECKING

from ...utils import (
    OptionalDependencyNotAvailable,
    _LazyModule,
    is_flax_available,
    is_tf_available,
    is_torch_available,
)


snake_case_				=			{'configuration_unispeech': ['UNISPEECH_PRETRAINED_CONFIG_ARCHIVE_MAP', 'UniSpeechConfig']}

try:
    if not is_torch_available():
        raise OptionalDependencyNotAvailable()
except OptionalDependencyNotAvailable:
    pass
else:
    snake_case_				=			[
        'UNISPEECH_PRETRAINED_MODEL_ARCHIVE_LIST',
        'UniSpeechForCTC',
        'UniSpeechForPreTraining',
        'UniSpeechForSequenceClassification',
        'UniSpeechModel',
        'UniSpeechPreTrainedModel',
    ]

if TYPE_CHECKING:
    from .configuration_unispeech import UNISPEECH_PRETRAINED_CONFIG_ARCHIVE_MAP, UniSpeechConfig

    try:
        if not is_torch_available():
            raise OptionalDependencyNotAvailable()
    except OptionalDependencyNotAvailable:
        pass
    else:
        from .modeling_unispeech import (
            UNISPEECH_PRETRAINED_MODEL_ARCHIVE_LIST,
            UniSpeechForCTC,
            UniSpeechForPreTraining,
            UniSpeechForSequenceClassification,
            UniSpeechModel,
            UniSpeechPreTrainedModel,
        )

else:
    import sys

    snake_case_				=			_LazyModule(__name__, globals()['__file__'], _import_structure, module_spec=__spec__)








from __future__ import annotations






def lowerCamelCase__    (							snake_case_	:  list[int]       ,      snake_case_	:  int       )      ->				list[list[int]]:
   __snake_case							       =   []
   __snake_case							       =   []
   __snake_case							       =   0
   __snake_case							       =   sum(snake_case_       )
   create_state_space_tree(snake_case_       ,      snake_case_       ,      snake_case_       ,      snake_case_       ,      snake_case_       ,      snake_case_       )
   return result






def lowerCamelCase__    (							snake_case_	:  list[int]       ,      snake_case_	:  int       ,      snake_case_	:  int       ,      snake_case_	:  list[int]       ,      snake_case_	:  list[list[int]]       ,      snake_case_	:  int       ,      )      ->				None:
   if sum(snake_case_       ) > max_sum or (remaining_nums_sum + sum(snake_case_       )) < max_sum:
      return
   if sum(snake_case_       ) == max_sum:
      result.append(snake_case_       )
      return
   for index in range(snake_case_       ,      len(snake_case_       )       ):
      create_state_space_tree(
          snake_case_       ,      snake_case_       ,      index + 1       ,      [*path, nums[index]]       ,      snake_case_       ,      remaining_nums_sum - nums[index]       ,      )
snake_case_				=			[3, 34, 4, 12, 5, 2]
snake_case_				=			9
snake_case_				=			generate_sum_of_subsets_soln(nums, max_sum)







print(*result)

