



"""simple docstring"""





def 	UpperCAmelCase     (		A	:						list[int]     ,				A	:						int       ):

		'''simple docstring'''


		_UpperCAmelCase							 =		len(A       )
		_UpperCAmelCase							 =		[[False] * (required_sum + 1) for _ in range(arr_len + 1       )]

		# for each arr value, a sum of zero(0) can be formed by not taking any element
		# hence True/1
		for i in range(arr_len + 1       ):
				_UpperCAmelCase							 =		True

		# sum is not zero and set is empty then false
		for i in range(1     ,				required_sum + 1       ):
				_UpperCAmelCase							 =		False

		for i in range(1     ,				arr_len + 1       ):
				for j in range(1     ,				required_sum + 1       ):
						if arr[i - 1] > j:
								_UpperCAmelCase							 =		subset[i - 1][j]
						if arr[i - 1] <= j:
								_UpperCAmelCase							 =		subset[i - 1][j] or subset[i - 1][j - arr[i - 1]]

		return subset[arr_len][required_sum]


if __name__ == "__main__":
					import doctest

					doctest.testmod()







"""simple docstring"""





import os




def 	UpperCAmelCase     (		):

		'''simple docstring'''


		_UpperCAmelCase							 =		os.path.join(os.path.dirname(A       )     ,				'num.txt'       )
		with open(A       ) as file_hand:
				return str(sum(int(A       ) for line in file_hand       )       )[:10]


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


