digits is a -level prime pair certificate. Leading zeroes are not permitted.likes numbers which are constructed by concatenating two prime numbers together. A number which can be formed by concatenating two primes that both have at least
Given two integers and , compute the smallest -level prime pair certificate greater than or equal to .
The output will never exceed .
There are no subtasks for this problem.
The input will consist of two positive space separated integers, and .
Output the smallest -level prime pair certificate greater than or equal to .