



"""simple docstring"""
def   A_    (     _lowercase = 100,   _lowercase = 100      ):







						'''simple docstring'''


						return max(
						    sum(int(_lowercase      ) for x in str(base**power      )      )
						    for base in range(_lowercase      )
						    for power in range(_lowercase      )      )


# Tests
if __name__ == "__main__":
						import doctest

						doctest.testmod()




'''simple docstring'''




from collections import Counter
from functools import total_ordering

from data_structures.heap.heap import Heap





@total_ordering
class _snake_case :
							"""simple docstring"""





							def __init__( self      ,					__A      ,					__A						)  ->None:



											"""simple docstring"""







											__lowerCamelCase		:   List[Any]           =       word
											__lowerCamelCase		:   Optional[Any]           =       count







							def __eq__( self      ,					__A						)  ->bool:



											"""simple docstring"""







											if not isinstance(__A      ,					__A						):
															return NotImplemented
											return self.count == other.count







							def __lt__( self      ,					__A						)  ->bool:



											"""simple docstring"""







											if not isinstance(__A      ,					__A						):
															return NotImplemented
											return self.count < other.count





def 				a_							(    lowercase				,    lowercase     )      ->list[str]:






				'''simple docstring'''

				__lowerCamelCase		:   Heap[WordCount]           =       Heap()
				__lowerCamelCase		:   int           =       Counter(lowercase     )
				heap.build_max_heap(
				    [WordCount(lowercase				,    lowercase     ) for word, count in count_by_word.items()]     )
				return [heap.extract_max().word for _ in range(min(lowercase				,    len(lowercase     )     )     )]


if __name__ == "__main__":
				import doctest

				doctest.testmod()





