跳到主要内容
图灵 OJTURING / ONLINE JUDGE

#F2582. Maxim and Calculator

    ID: 2588 传统题 2000ms 256MiB 尝试: 0 已通过: 0 难度: 9 上传者: 标签>枚举动态规划双指针算法思想挑战难度共享题库Codeforces英文题面题目来源题面语言

Maxim and Calculator

题目描述

E. Maxim and Calculator
time limit per test
4 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

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≤109,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

题目来源：fps-www.educg.net-codeforce-1-2833.xml.zip；FPS 共享题包，题包内第 2231 题。保留原作者与原赛事署名。