题号:NC229652
时间限制:C/C++/Rust/Pascal 2秒,其他语言4秒
空间限制:C/C++/Rust/Pascal 256 M,其他语言512 M
64bit IO Format: %lld
题目描述
Bieber is very interested in Euler function
recently, which means "among all positive integers less than or equal to
, How many numbers are relatively prime with
".
In his dream, Bieber drew a
grid map, and each grid in this grid map was written with a number, among which the number in the grid in the
row and the
column was
.
Now, Bieber looks at this grid map and is lost in thought.
Bieber has many questions about this grid graph, but one of the questions that ta wants to solve most is: What is the sum of all the numbers in this grid graph?
Now, you need to help Bieber solve this problem. Simply put, you need to find the value of this formula:
The answer is modulo
。
输入描述:
Enter a line containing two positive integers

输出描述:
Output a positive integer to represent the answer.