PROGRAMMING:Best friend
Li Hua is no longer the Li Hua he used to be. He is tired of all kinds of life that people describe to him in English, so he joined ACM on the recommendation of Xiao Yuan and became a good friend of Xiao Yuan. Once he finished a math problem, he exclaimed that "mathematics * *" in the * * competition was so wonderful that he became addicted to number theory, He also embarked on the road of number theory. He practiced hard and focused on number theory. Recently, he just learned how to retrieve numbers from Mobius. Every day, he sang "missing you in the cool night" and sighed at the same time. As a roommate, Xiao Yuan thought it was "Li Hua" and sighed about the beauty of number theory. So he wanted to help "Li Hua" better learn how to retrieve numbers from Mobius and experience the beauty of number theory, Just say to him: "I'll give you an inverse water problem" to enhance "self-confidence.". So the story of * * ends * *, and then we start to do the question given by Xiao Yuan * * of course, we can not only invert, but also try formula reasoning * *.
The topics are as follows:
$$\sum_{ i=1}^n\sum_{ j=1}^m\; gcd(i,j)\ast\lbrack gcd(i,j)\; is\; prime\rbrack$$
**Where [GCD (I, J) is prime] is a truth expression. If GCD (I, J) is prime, then the value of the expression is 1, otherwise it is 0. Truth expression: [the sun rises in the West], obviously the value is false, that is, 0, 0 times any number is 0, any number times 1 is the number itself, so [the sun rises in the West] $* $$$$666 = 0 $$. (*^ ▽^*) ！**
**Ask you to quickly solve the value of the above formula (set the answer to sum)! * *;
###Input format:
Enter a line, two integers $$n, M $$$$（ 1 <= n , m <= 10000000)$$
###Output format:
Output a line, an integer $$sum $$, representing the value of the above formula.
###Input example:
```in
3 3
```
###Output example:
```out
five
```
Example explanation:
**Here's a two-dimensional table (let's set the row from 1 to N, the column from 1 to m, and the result of GCD in the middle)**
| Column 1 | Column 2 | Column 3 | Column 4 |
| -------- | -------- | -------- | -------- |
| i \ j | 1 | 2 | 3 |
| 1 | 1 | 1 | 1 |
| 2 | 1 | 2 | 1 |
| 3 | 1 | 1 | 3 |
**
Only GCD (2,2) = 2 and GCD (3,3) = 3 are prime numbers, so the answer is 2 + 3 = 5**
answer：If there is no answer, please comment
The topics are as follows:
$$\sum_{ i=1}^n\sum_{ j=1}^m\; gcd(i,j)\ast\lbrack gcd(i,j)\; is\; prime\rbrack$$
**Where [GCD (I, J) is prime] is a truth expression. If GCD (I, J) is prime, then the value of the expression is 1, otherwise it is 0. Truth expression: [the sun rises in the West], obviously the value is false, that is, 0, 0 times any number is 0, any number times 1 is the number itself, so [the sun rises in the West] $* $$$$666 = 0 $$. (*^ ▽^*) ！**
**Ask you to quickly solve the value of the above formula (set the answer to sum)! * *;
###Input format:
Enter a line, two integers $$n, M $$$$（ 1 <= n , m <= 10000000)$$
###Output format:
Output a line, an integer $$sum $$, representing the value of the above formula.
###Input example:
```in
3 3
```
###Output example:
```out
five
```
Example explanation:
**Here's a two-dimensional table (let's set the row from 1 to N, the column from 1 to m, and the result of GCD in the middle)**
| Column 1 | Column 2 | Column 3 | Column 4 |
| -------- | -------- | -------- | -------- |
| i \ j | 1 | 2 | 3 |
| 1 | 1 | 1 | 1 |
| 2 | 1 | 2 | 1 |
| 3 | 1 | 1 | 3 |
**
Only GCD (2,2) = 2 and GCD (3,3) = 3 are prime numbers, so the answer is 2 + 3 = 5**
answer：If there is no answer, please comment