



"""simple docstring"""






def 	snake_case_  (				A_ :		list,    A_ :		list,    A_ :		int						):


							'''simple docstring'''





							if len(A_						) != len(A_						):
														raise ValueError('''The length of profit and weight must be same.'''						)
							if max_weight <= 0:
														raise ValueError('''max_weight must greater than zero.'''						)
							if any(p < 0 for p in profit						):
														raise ValueError('''Profit can not be negative.'''						)
							if any(w < 0 for w in weight						):
														raise ValueError('''Weight can not be negative.'''						)

							# List created to store profit gained for the 1kg in case of each weight
							# respectively.  Calculate and append profit/weight for each element.
							_lowerCamelCase						:    Dict         =			[p / w for p, w in zip(A_,    A_						)]

							# Creating a copy of the list and sorting profit/weight in ascending order
							_lowerCamelCase						:    Optional[int]         =			sorted(A_						)

							# declaring useful variables
							_lowerCamelCase						:    Optional[Any]         =			len(A_						)
							_lowerCamelCase						:    Union[str, Any]         =			0
							_lowerCamelCase						:    int         =			0
							_lowerCamelCase						:    Any         =			0

							# loop till the total weight do not reach max limit e.g. 15 kg and till i<length
							while limit <= max_weight and i < length:
														# flag value for encountered greatest element in sorted_profit_by_weight
														_lowerCamelCase						:    List[str]         =			sorted_profit_by_weight[length - i - 1]
														_lowerCamelCase						:    str         =			profit_by_weight.index(A_						)
														_lowerCamelCase						:    List[Any]         =			-1

														# check if the weight encountered is less than the total weight
														# encountered before.
														if max_weight - limit >= weight[index]:
																					limit += weight[index]
																					# Adding profit gained for the given weight 1 ===
																					# weight[index]/weight[index]
																					gain += 1 * profit[index]
														else:
																					# Since the weight encountered is greater than limit, therefore take the
																					# required number of remaining kgs and calculate profit for it.
																					# weight remaining / weight[index]
																					gain += (max_weight - limit) / weight[index] * profit[index]
																					break
														i += 1
							return gain


if __name__ == "__main__":
			print(
			    '''Input profits, weights, and then max_weight (all positive ints) separated by '''
			    '''spaces.'''
			)

			lowerCAmelCase__      =    [int(x) for x in input('''Input profits separated by spaces: ''').split()]
			lowerCAmelCase__      =    [int(x) for x in input('''Input weights separated by spaces: ''').split()]
			lowerCAmelCase__      =    int(input('''Max weight allowed: '''))

			# Function Call
			calc_profit(profit, weight, max_weight)







"""simple docstring"""






from itertools import permutations






def 	snake_case_  (				A_ :		tuple						):


       '''simple docstring'''





       if num[3] % 2 != 0:
              return False

       if (num[2] + num[3] + num[4]) % 3 != 0:
              return False

       if num[5] % 5 != 0:
              return False

       _lowerCamelCase						:    Any         =			[7, 11, 13, 17]
       for i, test in enumerate(A_						):
              if (num[i + 4] * 1_00 + num[i + 5] * 10 + num[i + 6]) % test != 0:
                     return False
       return True






def 	snake_case_  (				A_ :		int = 10						):


       '''simple docstring'''





       return sum(
           int(''''''.join(map(A_,    A_						)						)						)
           for num in permutations(range(A_						)						)
           if is_substring_divisible(A_						)						)


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


