Problem: Let's call some positive integer classy if its decimal representation contains no more than 3 non-zero digits. For example, numbers 4, 200000, 10203 are classy and numbers 4231, 102306, 7277420000 are not.

You are given a segment [L; R]. Count the number of classy integers x such that L ≤ x ≤ R.

Each testcase contains several segments, for each of them you are required to solve the problem separately.

Input

The first line contains a single integer T (1 ≤ T ≤ 10^4) — the number of segments in a testcase.

Each of the next T lines contains two integers L_i and R_i (1 ≤ L_i ≤ R_i ≤ 10^{18}).

Output

Print T lines — the i-th line should contain the number of classy integers on a segment [L_i; R_i].

Example

Input

4
1 1000
1024 1024
65536 65536
999999 1000001


Output

1000
1
0
2

Solution (in JAVA):

Solution:
//created by Whiplash99
import java.io.*;
import java.util.*;
public class A
{
    private static long[][][] dp;
    private static ArrayList<Integer> num;

    private static long digitDP(int pos, int count, int flag)
    {
        if(count>3) return 0;
        if(pos==num.size()) return 1;

        if(dp[pos][count][flag]!=-1) return dp[pos][count][flag];

        dp[pos][count][flag]=0;
        int lim=flag==0?num.get(pos):9;
        for(int i=1;i<=lim;i++)
        {
            int tmp=flag;
            if(flag==0&&i<lim) tmp=1;

            dp[pos][count][flag]+=digitDP(pos+1,count+1,tmp);
        }
        if(lim==0) dp[pos][count][flag]+=digitDP(pos+1,count,flag);
        else dp[pos][count][flag]+=digitDP(pos+1,count,1);

        return dp[pos][count][flag];
    }
    private static long solve(long N)
    {
        num.clear();
        for(int i=0;i<dp.length;i++)
        {
            for(int j=0;j<dp[0].length;j++)
                Arrays.fill(dp[i][j],-1);
        }

        while (N>0)
        {
            num.add((int)(N%10));
            N/=10;
        }
        Collections.reverse(num);

        return digitDP(0,0, 0);
    }
    public static void main(String[] args) throws Exception
    {
        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));

        int i;

        int T=Integer.parseInt(br.readLine().trim());
        StringBuilder sb=new StringBuilder();

        while (T-->0)
        {
            String[] s=br.readLine().trim().split(" ");
            long a=Long.parseLong(s[0]);
            long b=Long.parseLong(s[1]);

            num=new ArrayList<>();
            dp=new long[20][4][2];

            sb.append(solve(b)-solve(a-1)).append("\n");
        }
        System.out.println(sb);
    }
}