The package for this problem was not updated by the problem writer or Codeforces administration after we've upgraded the judging servers. To adjust the time limit constraint, a solution execution time will be multiplied by 2. For example, if your solution works for 400 ms on judging servers, then the value 800 ms will be displayed and used to determine the verdict.

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

The problem statement has recently been changed. View the changes.

×
E. Maxim and Calculator

time limit per test

4 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputMaxim 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:

- 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; - 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.

Examples

Input

2 10 3

Output

1

Input

2 111 100

Output

106

Input

2 111 11

Output

47

Codeforces (c) Copyright 2010-2022 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Aug/15/2022 03:14:54 (g1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|