/*
 * 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.Arrays;
import java.util.concurrent.ExecutorService;
import java.util.concurrent.Executors;

public class RecycledPairs {

	
	public static void main(String args[]) throws IOException {
		BufferedWriter resultWriter = new BufferedWriter(new FileWriter("C:\\Users\\Andriy\\workspaces\\codejam\\RecycledPairs\\src\\datasetOutput"));
		BufferedReader reader = new BufferedReader(new FileReader("C:\\Users\\Andriy\\Downloads\\C-small-attempt0.in"));
		int totalCases = Integer.parseInt(reader.readLine());
		int caseNumber = 0;
		while (++caseNumber <= totalCases) {
			String[] numbers = reader.readLine().split(" ");
			if (numbers.length != 2 || numbers[0].length() == 1) {
				resultWriter.write(String.format("Case #%d: %d\n", caseNumber, 0));
				continue;
			}
			int a = Integer.parseInt(numbers[0]);
			int b = Integer.parseInt(numbers[1]);
			int recycles = 0;
			
			final char[] buffer = new char[numbers[0].length()];
			for (int m = a+1; m <= b; m++) {
				final char[] mChar = String.valueOf(m).toCharArray();
				for (int n=a; n < m; n++) {
					final char[] nChar = String.valueOf(n).toCharArray();
					int length = 0;
					while (++length < mChar.length) {
						// skip leading zeros
						final int pivotPos = nChar.length - length;
						if (pivotPos == '0') {
							continue;
						}
						System.arraycopy(nChar, pivotPos, buffer, 0, length);
						System.arraycopy(nChar, 0, buffer, length, pivotPos);
						
						if (Arrays.equals(buffer, mChar)) {
							recycles++;
							break;
						}
					}
				}
			}
			resultWriter.write(String.format("Case #%d: %d\n", caseNumber, recycles));
		}
		resultWriter.flush();
		resultWriter.close();
	}
}
