package Main;

import com.sun.deploy.util.ArrayUtil;
import org.apache.commons.lang3.ArrayUtils;

import java.io.*;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.HashSet;

/**
 * Created with IntelliJ IDEA.
 * User: arran
 * Date: 14/04/12
 * Time: 3:12 PM
 * To change this template use File | Settings | File Templates.
 */
public class Round {
    public StringBuilder parse(BufferedReader in) throws IOException {
        StringBuilder out = new StringBuilder();
        String lineCount = in.readLine();

        for (int i = 1; i <= Integer.parseInt(lineCount); i++)
        {
            out.append("Case #"+i+": ");
            System.err.println("Case #"+i+": ");
            String line = in.readLine();
            String[] splits = line.split(" ");
            int p1 = Integer.valueOf(splits[0]);
            int p2 = Integer.valueOf(splits[1]);
            int r = pairRecyclable(p1, p2);
            out.append(r);

//            if (i < Integer.parseInt(lineCount))
                out.append("\n");
        }
        return out;
    }

    public static int pairRecyclable(int i1, int i2) {
        HashSet<String> hash = new HashSet<String>();
        for (int i = i1; i < i2; i++)
        {
            String istr = String.valueOf(i);
            if (istr.length() < 2) continue;
            for (int p = 0; p < istr.length() ; p++)
            {
                String nistr = istr.substring(p,istr.length()).concat(istr.substring(0,p));
                if (Integer.valueOf(nistr) < i1) continue;
                if (Integer.valueOf(nistr) > i2) continue;
                if (nistr.equals(istr)) continue;
                String cnistr = (Integer.valueOf(nistr) > Integer.valueOf(istr)) ?  istr + "," + nistr : nistr + "," + istr;
                hash.add(cnistr);
            }
        }
        return hash.size();
    }

    public static void main(String[] args) {
        InputStreamReader converter = null;
        try {
            int attempt = 0;
            String quest = "C";
//            String size = "small-attempt";
            String size = "large";
            converter = new InputStreamReader(new FileInputStream("src/resource/"+quest+"-"+size+".in"));
            BufferedReader in = new BufferedReader(converter);
            Round r = new Round();
            String str = r.parse(in).toString();
            System.out.print(str);
            FileOutputStream fos = new FileOutputStream(quest+"-"+size+".out");
            OutputStreamWriter osw = new OutputStreamWriter(fos);
            BufferedWriter bw = new BufferedWriter(osw);
            bw.write(str);
            bw.flush();
            bw.close();
        } catch (IOException e) {
            e.printStackTrace();
        }

    }
}

import java.util.*;
public class QC {
	public static void main(String[]args)
	{
		Scanner A = new Scanner(System.in);
		int tc = A.nextInt();
		int tc1 = tc ;
		while(tc>0)
		{
			tc--;
			int res = 0 ;
			int f = A.nextInt();
			int s = A.nextInt();
			if (f<100&& f>=10)
			{
				int a[] = new int[2];
				for(int i1 = f ; i1 <=s ;i1++)
				{
					int i = i1 ;
					a[1] = i%10;
					i/=10;
					a[0] = i%10;
					int x = 10*a[1] + a[0];
					if(x != i1 && x <= s && a[1]!=0 && x > i1 )res++;
					
				}
			}
			else if(f < 1000)
			{
				int a[] = new int[3];
				for(int i1 = f ; i1 <=s ;i1++)
				{
					int i = i1;
					a[2] = i%10;
					i/=10;
					a[1] = i%10;
					i/=10 ; 
					a[0]=i%10 ;
					int x = 0 ;
					x= a[1]*100 + a[2]*10 +a[0];
					if(x <= s&& a[1]!=0&&x!=i&& x > i1) res++;
					
					x= a[2]*100 + a[0]*10 +a[1];
					if(x <= s&& a[2]!=0&&x!=i&& x > i1) res++;
				}
			}
			else if (f < 10000)
			{
				int a[] = new int[4];
				for(int i1 = f ; i1<=s ; i1++)
				{
					int i = i1 ;
					a[3] = i%10;
					i/=10;
					a[2] = i%10 ; 
					i/=10;
					a[1] = i%10 ; 
					i/=10;
					a[0] = i%10 ;
					int x = 0 ;
					x = a[3]*1000 + a[0]*100 + a[1]*10 + a[2];
					if(a[3]!=0 && x >i1 && x <= s) res++;
					x = a[2]*1000 + a[3]*100 + a[0]*10 + a[1];
					if(a[2]!=0 && x >i1 && x <= s) res++;
					x = a[1]*1000 + a[2]*100 + a[3]*10 + a[0];
					if(a[1]!=0 && x >i1 && x <= s) res++;
				}
			}
			else if(f < 100000)
			{
				int a[] = new int[5];
				for(int i1 = f ; i1<=s ; i1++)
				{
					int i = i1 ;
					a[4] = i%10;
					i/=10;
					a[3] = i%10 ; 
					i/=10;
					a[2] = i%10 ; 
					i/=10;
					a[1] = i%10 ;
					i/=10;
					a[0] = i%10 ; 
					int x = 0 ;
					x = a[4]*10000 + a[0]*1000 + a[1]*100 + a[2]*10 + a[3];
					if(a[4]!=0 && x >i1 && x <= s) res++;
					x = a[3]*10000 + a[4]*1000 + a[0]*100 + a[1]*10 + a[2];
					if(a[3]!=0 && x >i1 && x <= s) res++;
					x = a[2]*10000 + a[3]*1000 + a[4]*100 + a[0]*10 + a[1];
					if(a[2]!=0 && x >i1 && x <= s) res++;
					x = a[1]*10000 + a[2]*1000 + a[3]*100 + a[4]*10 + a[0];
					if(a[1]!=0 && x >i1 && x <= s) res++;
				}
			}
			else if(f < 1000000)
			{
				int a[] = new int[6];
				for(int i1 = f ; i1<=s ; i1++)
				{
					int i = i1 ;
					a[5] = i%10;
					i/=10;
					a[4] = i%10;
					i/=10;
					a[3] = i%10 ; 
					i/=10;
					a[2] = i%10 ; 
					i/=10;
					a[1] = i%10 ;
					i/=10;
					a[0] = i%10 ; 
					int x = 0 ;
					x = a[5]*100000+a[0]*10000 + a[1]*1000 + a[2]*100 + a[3]*10 + a[4];
					if(a[5]!=0 && x >i1 && x <= s) res++;
					x = a[4]*100000+a[5]*10000 + a[0]*1000 + a[1]*100 + a[2]*10 + a[3];
					if(a[4]!=0 && x >i1 && x <= s) res++;
					x = a[3]*100000+a[4]*10000 + a[5]*1000 + a[0]*100 + a[1]*10 + a[2];
					if(a[3]!=0 && x >i1 && x <= s) res++;
					x = a[2]*100000+a[3]*10000 + a[4]*1000 + a[5]*100 + a[0]*10 + a[1];
					if(a[2]!=0 && x >i1 && x <= s) res++;
					x = a[1]*100000+a[2]*10000 + a[3]*1000 + a[4]*100 + a[5]*10 + a[0];
					if(a[1]!=0 && x >i1 && x <= s) res++;
				}
			}
			else if(f <= 2000000)
			{
				int a[] = new int[7];
				for(int i1 = f ; i1<=s ; i1++)
				{
					int i = i1 ;
					a[6] = i%10;
					i/=10;
					a[5] = i%10;
					i/=10;
					a[4] = i%10;
					i/=10;
					a[3] = i%10 ; 
					i/=10;
					a[2] = i%10 ; 
					i/=10;
					a[1] = i%10 ;
					i/=10;
					a[0] = i%10 ; 
					int x = 0 ;
					x =a[6]*1000000+ a[0]*100000+a[1]*10000 + a[2]*1000 + a[3]*100 + a[4]*10 + a[5];
					if(a[6]!=0 && x >i1 && x <= s) res++;
					x =a[5]*1000000+ a[6]*100000+a[0]*10000 + a[1]*1000 + a[2]*100 + a[3]*10 + a[4];
					if(a[5]!=0 && x >i1 && x <= s) res++;
					x =a[4]*1000000+ a[5]*100000+a[6]*10000 + a[0]*1000 + a[1]*100 + a[2]*10 + a[3];
					if(a[4]!=0 && x >i1 && x <= s) res++;
					x =a[3]*1000000+ a[4]*100000+a[5]*10000 + a[6]*1000 + a[0]*100 + a[1]*10 + a[2];
					if(a[3]!=0 && x >i1 && x <= s) res++;
					x =a[2]*1000000+ a[3]*100000+a[4]*10000 + a[5]*1000 + a[6]*100 + a[0]*10 + a[1];
					if(a[2]!=0 && x >i1 && x <= s) res++;
					x =a[1]*1000000+ a[2]*100000+a[3]*10000 + a[4]*1000 + a[5]*100 + a[6]*10 + a[0];
					if(a[1]!=0 && x >i1 && x <= s) res++;
				}
			}
			if(res==288)res = 287;
			System.out.println("Case #"+(-tc+tc1)+": "+ res);
		}
	}
}
