Let M – the sum of 5 of the maximum non-trivial divisors of an integer (not counting one and the number itself). If the number does not have 5 non-trivial divisors, then the M value is considered equal to zero.
Write a program that iterates over the integers less than 20 000 000, in descending order and finds among them the first five such that the value 0 < M < 5 000 000 and the number formed by 3, 2 and 1 digits of the number M is not greater than the number formed by 6, 5 and 4 digits of the number M (digits are counted from the end of the number, starting from 1) .
For example, with М = 12345678 the number formed by 3, 2 and 1 digits - 678, the number formed by 6, 5 and 4 digits - 345.
Print the first five found numbers and their corresponding values M.
Output format: for each of the five such found numbers in a separate line, the number itself is displayed first, then – value M (separated by one space). Lines are displayed in descending order of found numbers.