






def 		__UpperCAmelCase     (	):
							snake_case_           =				0
							for i in range(1				,	10_01):
														total += i**i
							return str(a_)[-10:]


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













from __future__ import annotations





def 		__UpperCAmelCase     (	a_				,	a_				,	a_):
							snake_case_           =				list(range(len(a_)))
							snake_case_           =				[v / w for v, w in zip(a_				,	a_)]
							index.sort(key=lambda a_: ratio[i]				,	reverse=a_)

							snake_case_           =				0
							snake_case_           =				[0] * len(a_)
							for i in index:
														if weight[i] <= capacity:
																					snake_case_           =				1
																					max_value += value[i]
																					capacity -= weight[i]
														else:
																					snake_case_           =				capacity / weight[i]
																					max_value += value[i] * capacity / weight[i]
																					break

							return max_value, fractions


if __name__ == "__main__":
	import doctest

	doctest.testmod()





