import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;


public class Main {

//	static int MAX = 10000;
	static int MAX = 2000000;
	static Object[] All = new Object[MAX+1];
	
	static int size( int x ) {
		if(x>999999) return 7;
		if(x>99999)  return 6;
		if(x>9999)   return 5;
		if(x>999)    return 4;
		if(x>99)     return 3;
		if(x>9)      return 2;
		return 1;
	}
	static int[] rotate( int value ) {
		List<Integer> result = new ArrayList<Integer>();
		int[] V = new int[8];
		int s = size(value);
		int x = value;
		
		for(int i=s-1;i>=0;i--) {
			V[i] = x%10;
			x /=10;
		}
		int rot;
		for(int i=1; i<s; i++) {
			if(V[i]!=0){
				rot=0;
				for(int j=0,ii=i;j<s; j++,ii=(ii+1)%s){
					rot=rot*10+V[ii];
				}
				if(rot>value && !result.contains(rot))
					result.add(rot);
			}
		}
		if( result.isEmpty() )
			return null;
		int[] r = new int[result.size()];
		for(int i=0; i<r.length; i++)
			r[i]=result.get(i);
		return r;
	}
	
	static void precalculate() {
		for(int i=1; i<=MAX; i++){
			All[i] = rotate(i);
		}
	}
	static int solve( Scanner in ) {
		int A, B, sol=0;
		
		A = in.nextInt();
		B = in.nextInt();

		for( int i=A; i<=B; i++) {
//			List<Integer> result = rotate(i);
			if( All[i]!=null ) {
				for(int value: (int[])All[i] ) {
					if( value <= B )
						sol++;
				}
			}
		}

		return sol;
	}
	
	public static void main ( String args[] ) {
		int T; 
		Scanner in = new Scanner(System.in);
		T = in.nextInt();
		int cnt=0;
		int sol;
		precalculate();
		for( cnt=1; cnt<=T; cnt++ ) {
			sol = solve( in );
			System.out.printf("Case #%d: %d\n", cnt, sol);
		}

	}
}

package recycle_no;

import java.io.*;
import java.util.Arrays;

public class Recycle_no {
    int N,a,b,count=0;
    String s="",temp[];
    public Recycle_no(){
        try {
            FileInputStream fis=new FileInputStream("C-large.in");
            DataInputStream dis=new DataInputStream(fis);
            FileOutputStream fos = new FileOutputStream("C-large.out");
            DataOutputStream dos=new DataOutputStream(fos);
            N=Integer.parseInt(dis.readLine());
            for(int i=1;i<=N;i++)
            {
                s=dis.readLine();
                count=0;
                temp=s.split(" ");
                a=Integer.valueOf(temp[0]);
                b=Integer.valueOf(temp[1]);
                for(int j=a;j<b;j++)
                {
                    count+=recycle(j, a, b);
                }
                s="Case #"+i+": "+count;
                if(i!=N)
                {
                    s=s+"\n";
                }
//                System.out.println(s);
                dos.writeBytes(s);
            }
            fis.close();
            fos.close();
            }catch(Exception e){
                System.out.println("Error: "+e);
            }

    }
    private int recycle(int n,int min,int max){
        int no=n,temp_no=n,r,digit=0,d,c=0,a[];
        while(temp_no!=0){
            temp_no=temp_no/10;
            digit++;
        }
        d=digit;
        a=new int[d];
        Arrays.fill(a, -1);
        while(d!=1){
            r=n%10;
            n=n/10;
            n=(int) (Math.pow(10,(digit-1))*r+n);
            if(n>=min && n<=max && n>no)
            {
                int flg=0;
                for(int j=0;j<a.length;j++)
                {
                    if(n==a[j])
                    {
                        flg=1;
                        break;
                    }
                }
                if(flg==0)
                {
                    a[c++]=n;
//                    System.out.println("val="+n+",no= "+no);
                }
            }
            d--;
        }
        return c;
    }
    public static void main(String[] args) {
       new Recycle_no();
    }
}
