



def        a( A			:       int = 1000			)						->			str:
					"""simple docstring"""





					a   	=  []
					a   	=  []
					a   	=  3
					a   	=  5
					a   	=  1
					while True:
										a   	=  z * temp
										if result < n:
															zmulti.append(A_			)
															temp += 1
										else:
															a   	=  1
															break
					while True:
										a   	=  x * temp
										if result < n:
															xmulti.append(A_			)
															temp += 1
										else:
															break
					a   	=  list(set(xmulti + zmulti			)			)
					return sum(A_			)


if __name__ == "__main__":
				print(F"""{solution() = }""")








"""simple docstring"""


from __future__ import annotations




def      snake_case    (A_ :int ):







  '''simple docstring'''

  assert (
      isinstance(A_      ,     A_ ) and mask > 0
  ), f'''mask needs to be positive integer, your input {mask}'''
  a	:     Any							=  []
  a	:     Union[str, Any]							=  mask

  while submask:
    all_submasks.append(A_ )
    a	:     Any							=  (submask - 1) & mask

  return all_submasks


if __name__ == "__main__":
   import doctest

   doctest.testmod()




