B - Soldier and Number Game

Two soldiers are playing a game. At the beginning first of them chooses a positive integer n and gives it to the second soldier. Then the second one tries to make maximum possible number of rounds. Each round consists of choosing a positive integer x > 1, such that n is divisible by x and replacing n with n / x. When n becomes equal to 1 and there is no more possible valid moves the game is over and the score of the second soldier is equal to the number of rounds he performed.

To make the game more interesting, first soldier chooses n of form a! / b! for some positive integer a and b (a ≥ b). Here by k! we denote the factorial of k that is defined as a product of all positive integers not large than k.

What is the maximum possible score of the second soldier?

Input

First line of input consists of single integer t (1 ≤ t ≤ 1 000 000) denoting number of games soldiers play.

Then follow t lines, each contains pair of integers a and b (1 ≤ b ≤ a ≤ 5 000 000) defining the value of n for a game.

Output

For each game output a maximum score that the second soldier can get.

Example
Input

2
3 1
6 3

Output

2
5
题意：题意看懂了上面的一大串英文之后其实很简单，就是给你一个正整数n，问你n有多少个质因子，不过这里n是通过a!/b!给定的，也就是说n=(a!/b!)=（1*2*3...*a)/(1*2*3...*b)
素数筛法，先把每个数能拆分成多少个素数预处理一下，之后用前缀和的思想，相减一下就行了

代码：

 #include<stdio.h>
#include<math.h>
#include<string.h>
#include<iostream>
#include<algorithm>
using namespace std;
const int maxn=5e6+5;
int num[maxn],sum[maxn];//打表，将n的质因子个数存到num[n]中　//sum[i]表示从num[1]到num[i]的和。
void solve(){
    num[1]=1;
    num[2]=1;
    for(int i=2;i<maxn;i++){
        if(num[i]>1)　//判断i是否为素数
            continue;
        num[i]=1;
        for(int j=2;j*i<maxn;j++){
            num[j*i]=num[j]+1;
        }
    }
    for(int i=1;i<maxn;i++)
        sum[i]=sum[i-1]+num[i];
}
int main()
{
    int t,a,b;
    solve();
    scanf("%d",&t);
    while(t--){
        scanf("%d%d",&a,&b);
    printf("%d\n",sum[a]-sum[b]);
    }
}