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

import java.io.File;
import java.io.FileWriter;
import java.util.ArrayList;
import java.util.Scanner;

/**
 *
 * @author daniele
 */
public class GCJ_C {
    
    public static void main(String[] args) throws Exception{
        
        
        
        Scanner in = new Scanner(new File(args[0]));
        FileWriter out = new FileWriter("/home/daniele/Scrivania/Output");
        

        int prove=in.nextInt();
        int min,max;
        int cifre;
        int cifreaus;
        String temp;
        int aus;
        int count=0;
        ArrayList<Integer> vals = new ArrayList<Integer>();
        int jcount=0;
        ArrayList<Integer> perm = new ArrayList<Integer>();
        
        out.write("");
        out.flush();
        
        for(int i=1;i<=prove;i++){
            
            out.append("Case #" +i+": ");out.flush();
            
            min=in.nextInt();
            max=in.nextInt();
            
            for(int j=min;j<=max;j++){
               if(!vals.contains(j)){
                    temp=""+j;
                    cifre=temp.length();
                    aus=j;
                    perm.add(j);
                    for(int k=1;k<cifre;k++){
                        aus=rotateOnce(aus);
                        temp=""+aus;
                        cifreaus=temp.length();//elusione zeri iniziali
                        if(aus>=min && aus<=max && aus!=j && cifreaus==cifre && nobody(vals,perm)){ 
                            perm.add(aus);
                            jcount ++;
                            
                        }
                        
                    }
                    while(jcount>0){count+=jcount; jcount--;}
                    vals.addAll(perm);
                    perm= new ArrayList<Integer>();
                    
                }
            }
            out.append(count+"\n");out.flush();
            count=0;
            vals= new ArrayList<Integer>();
        }
        
        
        
    }
        static public int rotateOnce(int n){
            String s=""+n;
            if(s.length()>1){
                s=s.charAt(s.length()-1) + s.substring(0,s.length()-1);
                n=Integer.parseInt(s);
            }
            return n;
        }    
        
        static public boolean nobody(ArrayList<Integer> v,ArrayList<Integer> a){;
            for(int i=0;i<a.size();i++)
                if(v.contains(a.get(i))) return false;
            return true;
        } 
    
}


import java.io.*;

public class RecycledNumbers {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		try {
			FileInputStream fstream = new FileInputStream("CProblem/C-small-attempt2.in");
			// Get the object of DataInputStream
			DataInputStream in = new DataInputStream(fstream);
			BufferedReader br = new BufferedReader(new InputStreamReader(in));

			FileWriter fwstream = new FileWriter("CProblem/Cout.txt");
			BufferedWriter out = new BufferedWriter(fwstream);

			String strLine = br.readLine();
			int n = 0;
			int A, B;
			RecycledNumbers recycledNumbers = new RecycledNumbers();
			if (strLine != null) {
				n = Integer.parseInt(strLine);
				System.out.println(n);
			}
			// Read File Line By LIN
			for (int i = 0; i < n; i++) {
			if ((strLine = br.readLine()) != null) {
				String[] numbers = strLine.split(" ");
				A = Integer.parseInt(numbers[0]);
				B = Integer.parseInt(numbers[1]);
				int count = recycledNumbers.calculate(A, B);
				out.write("Case #"+(i+1)+": "+count+'\n');
			}
		}
			// Close the input stream
			in.close();
			out.close();
		} catch (Exception e) {// Catch exception if any
			System.err.println("Error: " + e.getMessage());
		}
	}

	private int calculate(int A, int B) {
		int count = 0;
		int n,m;
		for (int i = A; i <= B; i++) {
			String num1 = String.valueOf(i);
			//String num2 = String.valueOf(B);
			String str="";
			 n = Integer.parseInt(num1);
			if (num1.length() == 1) {
				return 0;
			}
			switch (num1.length()) {
			case 4:
				str = num1.charAt(num1.length() - 1) + num1.substring(0, 3);
				m = Integer.parseInt(str);
				count = check(count, A, n, m, B);
				str = num1.substring(2, 4) + num1.substring(0, 2);
				m = Integer.parseInt(str);
				count = check(count, A, n, m, B);
				str = num1.substring(1, 4) + num1.charAt(0);
				m = Integer.parseInt(str);
				count = check(count, A, n, m, B);
				break;
			case 3:
				str = num1.charAt(num1.length() - 1) + num1.substring(0, 2);
				m = Integer.parseInt(str);
				count = check(count, A, n, m, B);
				str = num1.substring(1, 3) + num1.charAt(0);
				m = Integer.parseInt(str);
				count = check(count, A, n, m, B);
				break;
			case 2:
				str = num1.charAt(num1.length() - 1) + num1.substring(0, 1);
				m = Integer.parseInt(str);
				count = check(count, A, n, m, B);
				break;
			default:
				break;
			}
		}
		return count;

	}
	public int check(int count, int A, int n, int m, int B) {
		if (A <= n && n < m && m <= B) {
			count++;
		}
		return count;
	}

}
