/*
 * 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.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;

public class RecycledNumber {

    private int numCase;

    public void calc() throws FileNotFoundException, IOException {

        FileReader reader = new FileReader("D:/C-small-attempt0.in");
        BufferedReader bf = new BufferedReader(reader);

        FileWriter writer = new FileWriter("D:/output.txt");
        BufferedWriter bw = new BufferedWriter(writer);

        numCase = Integer.parseInt(bf.readLine());
        int n, m;
        for (int all = 1; all <= numCase; all++) {
            String[] inp = bf.readLine().split(" ");
            n = Integer.parseInt(inp[0]);
            m = Integer.parseInt(inp[1]);
            int count = 0;
            if (n < 10) {
                count = 0;
            } else if (n < 100) {
                for (int i = n; i <= m; i++) {
                    String temp = i + "";
                    String rv = temp.charAt(1) + "" + temp.charAt(0);
                    if (Integer.parseInt(rv) >= n && Integer.parseInt(rv) <= m && Integer.parseInt(rv) != i) {
//                        System.out.println("I : " + i + " RV : " + rv);
                        count++;
                    }
                }
            } else if (n >= 100 && n <= 999) {
                for (int i = n; i <= m; i++) {
                    String temp = i + "";
                    String rv = temp.charAt(2) + "" + temp.charAt(0) + "" + temp.charAt(1);
                    if (Integer.parseInt(rv) >= n && Integer.parseInt(rv) <= m && Integer.parseInt(rv) != i) {
//                        System.out.println("I : " + i + " RV : " + rv);
                        count++;
                    }
                    rv = temp.charAt(1) + "" + temp.charAt(2) + "" + temp.charAt(0);
                    if (Integer.parseInt(rv) >= n && Integer.parseInt(rv) <= m && Integer.parseInt(rv) != i) {
//                        System.out.println("I : " + i + " RV : " + rv);
                        count++;
                    }
                }
            } else if (n >= 1000 & n <= 9999) {
                for (int i = n; i <= m; i++) {
                    String temp = i + "";
                    String rv = temp.charAt(1) + "" + temp.charAt(2) + "" + temp.charAt(3) + "" + temp.charAt(0);
                    if (Integer.parseInt(rv) >= n && Integer.parseInt(rv) <= m && Integer.parseInt(rv) != i) {
//                        System.out.println("I : " + i + " RV : " + rv);
                        count++;
                    }
                    rv = temp.charAt(2) + "" + temp.charAt(3) + "" + temp.charAt(0) + "" + temp.charAt(1);
                    if (Integer.parseInt(rv) >= n && Integer.parseInt(rv) <= m && Integer.parseInt(rv) != i) {
//                        System.out.println("I : " + i + " RV : " + rv);
                        count++;
                    }
                    rv = temp.charAt(3) + "" + temp.charAt(0) + "" + temp.charAt(1) + "" + temp.charAt(2);
                    if (Integer.parseInt(rv) >= n && Integer.parseInt(rv) <= m && Integer.parseInt(rv) != i) {
//                        System.out.println("I : " + i + " RV : " + rv);
                        count++;
                    }
                }
            }
            System.out.println("Case #" + all + ": " + count / 2);
            bw.write("Case #" + all + ": " + count / 2+"\r\n");
        }
        bw.close();
        writer.close();
        bf.close();
        reader.close();
    }

    public static void main(String[] args) throws FileNotFoundException, IOException {
        RecycledNumber rn = new RecycledNumber();
        rn.calc();
    }
}