import java.io.*;

class code1
{
	public static void main(String args[]) throws Exception 
	{
		File ii = new File ("C-small-attempt1.in");
		FileInputStream fis = new FileInputStream(ii);
		BufferedReader  br = new BufferedReader(new InputStreamReader (fis));
		int cases = Integer.parseInt(br.readLine());
		FileOutputStream fout = new FileOutputStream ("output.txt");
		DataOutputStream dout = new DataOutputStream (fout);
		int total=0;
		for(int i=0;i<cases;i++){
		String temp = br.readLine();
		String parts [] = temp.split(" ");
		int lower = Integer.parseInt(parts[0]);
		int upper = Integer.parseInt(parts[1]);
		System.out.println(lower+" "+upper);
		
		for(int j=lower;j<=upper;j++)
		{
			int abc = j;int length=0;
			if(j<10)continue;
			while (abc!=0){abc/=10;length++;}
			abc=j;
			for(int m=0;m<length-1;m++){
				int shift = abc%10;
				abc=abc/10;
				System.out.println("hi "+j);
				abc=abc+shift*power(10,length-1);
				if(abc<=upper&&shift!=0&&abc>j)total++;
				System.out.println(total);
			}
		}
 		dout.writeBytes("Case #"+(i+1)+ ": "+total+"\n");
 		total=0;
		}//for close
		
	}

	private static int power(int i, int j) {
		int no=1;
		for(int a=0;a<j;a++){no=10*no;}
		return no;
	}
}
// Google Code Jam Qualification Round 2012
// Problem C. Recycled Numbers

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

public class RecycledNumbers{
    static String inname = "C-small-attempt0.in";    // input file name here
    static String outname = "C-small-attempt0.out";  // output file name here
    public static void main(String[] args){
        try{
            Scanner in = new Scanner(new BufferedReader(new FileReader(inname)));
        	//Scanner in = new Scanner(System.in);
            BufferedWriter out = new BufferedWriter(new FileWriter(outname));
            int t = in.nextInt();
            int a, b;
            for (int cas = 1; cas <= t; cas++){
            	int ans = 0;
            	a = in.nextInt();
            	b = in.nextInt();
                for (int n = a; n < b; n++){
                	String ns = Integer.toString(n);
                	int d = ns.length();
                	int mss[] = new int[d];
                	for(int i = 1; i < d; i++){
                		String ms = ns.substring(i);
                		ms += ns.substring(0,i);
                		int m = Integer.parseInt(ms);
                		mss[i] = m;
                		if (n < m && m > a && m <= b){ 
                			boolean flag = true;
                			for (int j = 0; j < i; j++) 
                				if (m == mss[j]) flag = false;
                			if (flag) ans++;
                		}
                	}
                }
                //System.out.print("Case #" + cas + ": " + ans + "\n");
                out.write("Case #" + cas + ": " + ans + "\n");
            }
            in.close();
            out.close();
        } catch (IOException e) {
            e.printStackTrace();
        }
    }
}