import
java.io.*;
import
java.util.Vector;
class
GFG {
static
void
SieveOfEratosthenes(
int
n,
Vector<Integer> v,
int
k)
{
boolean
[] prime =
new
boolean
[n +
1
];
for
(
int
i =
0
; i < n +
1
; i++) prime[i] =
true
;
for
(
int
i =
2
; i * i <= n; i++) {
if
(prime[i]) {
for
(
int
j = i * i; j <= n;
j += i)
prime[j] =
false
;
}
}
for
(
int
i =
2
; i < n; i++) {
if
(prime[i]) {
v.add(i);
}
if
(v.size() == k) {
break
;
}
}
}
static
int
total_count(
int
L,
int
R,
int
k)
{
Vector<Integer> v =
new
Vector<>();
SieveOfEratosthenes(
100000
, v, k);
int
[] arr =
new
int
[R +
1
];
for
(
int
i =
0
; i < v.size(); i++) {
int
val;
if
(L % v.get(i) ==
0
) {
val = L;
}
else
{
val = ((L / v.get(i)) +
1
) * v.get(i);
}
for
(
int
j = val; j <= R; j = j
+ v.get(i)) {
arr[j] =
1
;
}
}
int
count =
0
;
for
(
int
i = L; i <= R; i++) {
if
(arr[i] ==
0
) {
count++;
}
}
return
count;
}
public
static
void
main (String[] args) {
int
L =
10
, R =
25
;
int
K =
3
;
System.out.print(total_count(L, R, K));
}
}