


'''simple docstring'''



from __future__ import annotations




def      _a     (						_lowercase :     int      , _lowercase :     int  ):





     '''simple docstring'''






     __UpperCAmelCase     :			list[list[int]]  							=      []
     create_all_state(1      , _lowercase      , _lowercase      , []      , _lowercase  )
     return result




def      _a     (						_lowercase :     int      , _lowercase :     int      , _lowercase :     int      , _lowercase :     list[int]      , _lowercase :     list[list[int]]      , ):





     '''simple docstring'''






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

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




def      _a     (						_lowercase :     list[list[int]]  ):





     '''simple docstring'''






     for i in total_list:
          print(*_lowercase  )


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



'''simple docstring'''



def      _a     (						_lowercase :     List[str]  ):





     '''simple docstring'''






     __UpperCAmelCase     :			str  							=      1
     __UpperCAmelCase     :			List[str]  							=      2
     while i * i <= n:
          __UpperCAmelCase     :			Optional[Any]  							=      0
          while n % i == 0:
               n //= i
               multiplicity += 1
          n_divisors *= multiplicity + 1
          i += 1
     if n > 1:
          n_divisors *= 2
     return n_divisors




def      _a     (						):





     '''simple docstring'''






     __UpperCAmelCase     :			Optional[Any]  							=      1
     __UpperCAmelCase     :			List[Any]  							=      1

     while True:
          i += 1
          t_num += i

          if count_divisors(_lowercase  ) > 500:
               break

     return t_num


if __name__ == "__main__":
      print(solution())