3394. Brute Force

Description

The divisor function, for a positive integer n is defined as the sum of thepowers of the divisors of.

is a noob who can only solve some problems with brute-force tag, and today he want to calculate

Without a single doubt, he got a TLE, so he want you to help him solve this problem.

Considered that the answer maybe too large, he only requires you to find the answer modulo.

Input

The first line contains three positive integers

Output

Output one integer, represents the answer modulo.

Sample Input

1 2 3

Sample Output

14

 

难度等级：	0
总通过次数：	3
总提交次数：	63