Maxim has got a calculator. The calculator has two integer cells. Initially, the first cell contains number $1$, and the second cell contains number $0$. In one move you can perform one of the following operations:

1. Let's assume that at the current time the first cell contains number $*a*$, and the second cell contains number $*b*$. Write to the second cell number $*b* + 1$;
2. Let's assume that at the current time the first cell contains number $*a*$, and the second cell contains number $*b*$. Write to the first cell number $*a*·*b*$.

Maxim is wondering, how many integers $*x*$ $(*l* ≤ *x* ≤ *r*)$ are there, such that we can write the number $*x*$ to the first cell of the calculator, having performed at most $*p*$ moves.

Input

The first line contains three integers: $*l*$, $*r*$, $*p*$ $(2 ≤ *l* ≤ *r* ≤ 10^{9}, 1 ≤ *p* ≤ 100)$.

The numbers in the line are separated by single spaces.

Output

In a single line print a single integer — the answer to the problem.