




from __future__ import annotations




def 					lowerCamelCase__       (						A__       :					int  ,			A__       :					int	):





       '''simple docstring'''



       __lowerCamelCase   =						[]
       create_all_state(1  ,			A__  ,			A__  ,			[]  ,			A__	)
       return result




def 					lowerCamelCase__       (						A__       :					int  ,			A__       :					int  ,			A__       :					int  ,			A__       :					list[int]  ,			A__       :					list[list[int]]  ,			):





       '''simple docstring'''



       if level == 0:
              total_list.append(current_list[:]	)
              return

       for i in range(A__  ,			total_number - level + 2	):
              current_list.append(A__	)
              create_all_state(i + 1  ,			A__  ,			level - 1  ,			A__  ,			A__	)
              current_list.pop()




def 					lowerCamelCase__       (						A__       :					list[list[int]]	):





       '''simple docstring'''



       for i in total_list:
              print(*A__	)


if __name__ == "__main__":
       UpperCAmelCase_									=	4
       UpperCAmelCase_									=	2
       UpperCAmelCase_									=	generate_all_combinations(n, k)
       print_all_state(total_list)








from __future__ import annotations

from collections.abc import Iterable, Iterator
from dataclasses import dataclass

snake_case__					:							Union[str, Any]													=     (3, 9, -11, 0, 7, 5, 1, -1)
snake_case__					:							int													=     (4, 6, 2, 0, 8, 10, 3, -2)





@dataclass
class A_					:
   lowerCAmelCase__        = 42
   lowerCAmelCase__        = 42





class A_					:




   def __init__(self	:Dict    ,   _UpperCamelCase	:Iterable[int] )->					None:
         __A          =				None
         for i in sorted(_UpperCamelCase    ,   reverse=_UpperCamelCase ):
               __A          =				Node(_UpperCamelCase    ,   self.head )




   def __iter__(self	:List[str] )->					Iterator[int]:
         __A          =				self.head
         while node:
               yield node.data
               __A          =				node.next_node




   def __len__(self	:Union[str, Any] )->					int:
         return sum(1 for _ in self )






   def __str__(self	:List[Any] )->					str:
         return " -> ".join([str(_UpperCamelCase ) for node in self] )





def _a				(	lowerCamelCase:   SortedLinkedList					,				lowerCamelCase:   SortedLinkedList )	->						SortedLinkedList:







      '''simple docstring'''






      return SortedLinkedList(list(lowerCamelCase ) + list(lowerCamelCase ) )


if __name__ == "__main__":
       import doctest

       doctest.testmod()
       snake_case__					:							Any													=     SortedLinkedList
       print(merge_lists(SSL(test_data_odd), SSL(test_data_even)))





