CF261E.Maxim and Calculator

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.

马克西姆有一个计算器。该计算器有两个整数存储单元。初始时，第一个单元中存有数字 $1$，第二个单元中存有数字 $0$。每一步操作中，你可以执行以下两种操作之一：

1. 假设当前第一个单元中存有数字 $a$，第二个单元中存有数字 $b$，则将数字 $b+1$ 写入第二个单元；
2. 假设当前第一个单元中存有数字 $a$，第二个单元中存有数字 $b$，则将数字 $a \cdot b$ 写入第一个单元。

马克西姆想知道：在最多进行 $p$ 步操作的前提下，有多少个整数 $x$（满足 $l \le x \le r$）可以被写入计算器的第一个单元中？

The first line contains three integers: l, r, p (2 ≤ l ≤ r ≤ 109, 1 ≤ p ≤ 100).

The numbers in the line are separated by single spaces.

第一行包含三个整数：$l$、$r$、$p$（$2 \le l \le r \le 10^9$，$1 \le p \le 100$）。

行中的数字以单个空格分隔。

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

在一行中输出一个整数——该问题的答案。