Task
Time limit:
1000 ms,
Memory limit:
32 Mb
Two integers a and b are given.
Write a program that iterates over all integers from a to b and finds the product of those that, when multiplied by the number 6, give a result ending in the number 2.
Input:
The first line contains two integers a and b (a <= b, a, b no more than 100 modulo)
Output:
The program should output one number - the multiplication of integers from a to b, the multiplication of which is 6 ends with 2. If there are no such numbers, output 0
Example