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

public class Recycled {

		public static void main(String args[]) {
			try {
				File file = new File("input.txt");
				FileReader filereader = new FileReader(file);
				BufferedReader br = new BufferedReader(filereader);

				File out = new File("output.txt");
				FileWriter filewriter = new FileWriter(out);
				BufferedWriter bw = new BufferedWriter(filewriter);
				PrintWriter pw = new PrintWriter(bw);

				String str = br.readLine();
				int line = Integer.valueOf(str);
				for (int i = 0; i < line; i++) {
					int x = i + 1;
					pw.print("Case #" + x + ": ");
					str = br.readLine();
					int ans = solve(str);
					pw.println(ans);
				}
				pw.close();
				bw.close();

			} catch (IOException ie) {
				ie.printStackTrace();
			}
		}

		private static int solve(String s) {
			List<String> list = new ArrayList<String>();
			int count = 0;
			String[] elems = s.split(" ");
			int A = Integer.valueOf(elems[0]);
			int B = Integer.valueOf(elems[1]);
			for (int i = A; i <= B; i++) {
				String str = String.valueOf(i);
				if(str.length() <= 1) continue;
				for(int j = 0; j < str.length() - 1; j++) {
					String after = str.substring(0, j+1);
					String before = str.substring(j+1,str.length());
					String strRecycled = before + after;
					int recycled = Integer.valueOf(strRecycled);
					if(i<recycled && recycled<=B) {
						String q = String.valueOf(i)+String.valueOf(recycled);
					    if(!list.contains(q)) { list.add(q); count++; }
					}
				}

			}
			return count;

		}
}


