





def _a				(	lowerCamelCase:   str )	->						str:







      '''simple docstring'''






      return " ".join(input_str.split()[::-1] )


if __name__ == "__main__":
       import doctest

       doctest.testmod()












def _a				(	lowerCamelCase:   int = 2_00 )	->						int:







      '''simple docstring'''






      __A          =				[1, 2, 5, 10, 20, 50, 1_00, 2_00]
      __A          =				[0] * (pence + 1)
      __A          =				1  # base case: 1 way to make 0 pence

      for coin in coins:
            for i in range(lowerCamelCase					,				pence + 1					,				1 ):
                  number_of_ways[i] += number_of_ways[i - coin]
      return number_of_ways[pence]


if __name__ == "__main__":
       assert solution(200) == 73682





