






def      snake_case		(							UpperCAmelCase	:       int = 3,						UpperCAmelCase	:       int = 7,						UpperCAmelCase	:       int = 1_00_00_00   ):
				A	 =      0
				A	 =      1

				for current_denominator in range(1,						limit + 1   ):
								A	 =      current_denominator * numerator // denominator
								if current_denominator % denominator == 0:
												current_numerator -= 1
								if current_numerator * max_denominator > current_denominator * max_numerator:
												A	 =      current_numerator
												A	 =      current_denominator
				return max_numerator


if __name__ == "__main__":
					print(solution(numerator=3, denominator=7, limit=1_000_000))













from itertools import permutations







def      snake_case		(							UpperCAmelCase	:       tuple   ):
				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

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







def      snake_case		(							UpperCAmelCase	:       int = 10   ):
				return sum(
				    int(''.join(map(UpperCAmelCase,						UpperCAmelCase   )   )   )
				    for num in permutations(range(UpperCAmelCase   )   )
				    if is_substring_divisible(UpperCAmelCase   )   )


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





