K-th Power
时间限制:C/C++/Rust/Pascal 1秒,其他语言2秒
空间限制:C/C++/Rust/Pascal 512 M,其他语言1024 M
64bit IO Format: %lld

题目描述

Walk_alone hates numbers with large exponents, and he considers an integer x as good if and only if there does not exist a prime number p, such that x is a multiple of . He hopes to find the number of all good integers in range .

输入描述:

The only line of input contains three integers  and , indicating the lower range, upper range of the querying interval and the asked k mentioned above.

输出描述:

Output a single integer indicating the number of good integers in range of .
示例1

输入

复制
1 10 2

输出

复制
7

说明

In the example above, 4 and 8 are multiples of 2^2, and 9 is a multiple of 3^2.