/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

package recycled;

import java.io.BufferedReader;
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.FileWriter;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.TreeSet;

/**
 *
 * @author Alfred
 */
public class Main {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
    try {
            FileInputStream fstream = new FileInputStream("C-small-attempt0.in");
            DataInputStream in = new DataInputStream(fstream);
            BufferedReader br = new BufferedReader(new InputStreamReader(in));
            FileWriter outFile = new FileWriter("out.txt");
            PrintWriter out = new PrintWriter(outFile);
            String line;
            line = br.readLine();
            int cases = Integer.parseInt(line);
            for (int i=1; i<=cases;i++){
                line = br.readLine();
                String[] values = line.split(" ");
                int A = Integer.parseInt(values[0]);
                int B = Integer.parseInt(values[1]);
                int total=0;
                for (int n=A; n<=B;n++){
                    TreeSet<String> solutions = new TreeSet<String>();
                    for (int k=1;k<values[1].length();k++){
                        String m = circshift(n,k);
                        int mVal = Integer.parseInt(m);
                        if(mVal<=B && mVal!=n  && mVal> n && !m.startsWith("0") && m.length()==Integer.toString(n).length() )
                        {
                            solutions.add(m);
                        }                   
                    }
                    total+=solutions.size();
                }
                out.println("Case #"+i+": "+total);
            }
            in.close();
            out.close();
        } catch (Exception e) {//Catch exception if any
            System.err.println("Error: " + e.getMessage());
        }

}

    private static String circshift(int n, int k) {
        String nString=Integer.toString(n);
        int len=nString.length();
        String m =  nString.substring(len-k)+nString.subSequence(0, len-k);
        //System.out.println(n+" "+m);
        return m;
    }

}

import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;




public class recyclednumbers {

	public static void main(String [] args) throws Exception
	{
		BufferedReader reader = new BufferedReader (new FileReader("C:\\inputFile.txt"));
		
		int number_of_TestCases = (int) Integer.parseInt(reader.readLine());
		
		long testcases[] [] = new long [number_of_TestCases] [2];
		
		for(int i=0;i<number_of_TestCases; i++)
		{
			String testcase = reader.readLine();
			
			testcase = testcase.trim();
			
			String [] inputs = testcase.split(" ");
			
			testcases[i][0] = Long.parseLong(inputs[0]);
			testcases[i][1] = Long.parseLong(inputs[1]);
			
			long result = findDistinctPairs ( testcases [i][0], testcases[i][1]);
			writeResult(i+1, result);
		}	
	
		
	}
	
	private static long findDistinctPairs(long a, long b) 
	{
		long totalpairs_count = 0;
		
		while(a<=b)
		{
			long pairs_count = findPair(a,b);						
			a++;
			totalpairs_count += pairs_count;
		}
		return totalpairs_count;
	}
	
	private static void writeResult(int testcase, long result) throws Exception
	{
		FileWriter fout = new FileWriter("C:\\recycleout.txt", true);
		String output= "Case #"+testcase+": "+result+System.getProperty("line.separator");
		fout.write(output);
		fout.close();
	}
	
	private static long findPair(long a,long upperLimit)
	{
		long pairs_count =0;
		String a_str = Long.toString(a);
		String b = rotate(a_str);
		

		while(!b.equals(a_str))
		{
			long b_val = Long.parseLong(b);
			if(b_val<=upperLimit && b_val>a ) // also check for leading zero
			{
				pairs_count++;
			
			}
			b = rotate(b);
		}
		return pairs_count;
	}
	
	private static String rotate(String a)
	{
		String num = a;
		char[] digits= num.toCharArray();
		
		String newNum = ""+digits[digits.length-1];
		
		for(int i=0;i<digits.length-1;i++)
			newNum = newNum+digits[i];
		
		return newNum;
	}
}
