A8961 | Prime Matrix

You've got an $n×m$ matrix. The matrix consists of integers. In one move, you can apply a single transformation to the matrix: choose an arbitrary element of the matrix and increase it by $1$ . Each element can be increased an arbitrary number of times.

You are really curious about prime numbers. Let us remind you that a prime number is a positive integer that has exactly two distinct positive integer divisors: itself and number one. For example, numbers 2, 3, 5 are prime and numbers 1, 4, 6 are not.

A matrix is prime if at least one of the two following conditions fulfills:

- the matrix has a row with prime numbers only;
- the matrix has a column with prime numbers only;

Your task is to count the minimum number of moves needed to get a prime matrix from the one you've got.

The first line contains two integers $n,m$ $(1<=n,m<=500)$ — the number of rows and columns in the matrix, correspondingly.

Each of the following $n$ lines contains $m$ integers — the initial matrix. All matrix elements are positive integers. All numbers in the initial matrix do not exceed $10^{5}$ .

The numbers in the lines are separated by single spaces.

Print a single integer — the minimum number of moves needed to get a prime matrix from the one you've got. If you've got a prime matrix, print 0.