/*
 * 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.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.ArrayList;


public class Recycled_Numbers_2 {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		String strFileName = "C-small-attempt0";
		String strInputFileName = strFileName + ".in";
		String strOutputFileName = strFileName + ".out";

		int iCaseNumber=1;
		
		try {
			////////////////////////////////////////////////////////////////
			BufferedReader in = new BufferedReader(new FileReader(strInputFileName));
			BufferedWriter out = new BufferedWriter(new FileWriter(strOutputFileName));
			String inString = "";
			String outString = "";

			String sTotalNumber = in.readLine();
			
			while ((inString = in.readLine()) != null) {
				System.out.println(inString);
				// µÎ °³ÀÇ ¼ýÀÚ·Î ÀÌ·ç¾îÁ® ÀÖ´Ù.
				String[] saRange = inString.split(" ");
				int iStart = Integer.parseInt(saRange[0]);
				int iEnd = Integer.parseInt(saRange[1]);
				System.out.println(String.format("S:[%d], E:[%d]", iStart, iEnd));
				
				ArrayList<Integer> listCompare = new ArrayList<>();
				int iCount = 0;
				
				for (int iNumber = iStart; iNumber <= iEnd; iNumber++) {
					
					// ¼öÀÇ ÀÚ¸´¼ö ¾ò±â
					int iGetDigit = iNumber;
					int iDigitCount = 0;
					while (iGetDigit > 0) {							
						iGetDigit /= 10;
						iDigitCount++;
					}
					
					//System.out.println(String.format("%d's Digit is %d",iNumber, iDigitCount));
					
					boolean bFound = false;
					
					// ºñ±³
					for (int idx = 0; idx < listCompare.size(); idx++) {
						int iCompareNumber = listCompare.get(idx);
												
						for (int iDigit = 1; iDigit <= iDigitCount-1; iDigit++) {
							int iFront = (int) (iNumber/(Math.pow(10, iDigit)));
							int iBack = (int) (iNumber%(Math.pow(10, iDigit)));
							int iModify = (int) (iBack * (Math.pow(10, iDigitCount-iDigit)) + iFront);
							
//							System.out.println(String.format("Check: iNumber:[%d], iDigit:[%d], iFront:[%d], iBack:[%d], iModify:[%d]"
//																		, iNumber, iDigit, iFront, iBack, iModify));
							
							if (iCompareNumber == iModify) {
								//System.out.println(String.format("Compare:[%d], iNumber:[%d], iModify[%d], iDigit[%d]", iCompareNumber, iNumber, iModify, iDigit));
								iCount ++;
								//listCompare.remove(idx);
								bFound = true;
								//break;
							}
							
						}
						
//						if (bFound) {
//							break;
//						}						
					}
					listCompare.add(iNumber);
					
				}
				
				System.out.println(String.format("Count:[%d]",iCount));
				
				outString = String.format("Case #%d: %d\n", iCaseNumber++, iCount); 
				System.out.print(outString);
				out.write(outString);
			}
			in.close();
			out.close();
			////////////////////////////////////////////////////////////////
		} catch (IOException e) {
			System.err.println("ERROR");
			System.err.println(e); // ¿¡·¯°¡ ÀÖ´Ù¸é ¸Þ½ÃÁö Ãâ·Â
			System.exit(1);
		}	     
	}

}
