/*
 * 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.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.Scanner;

public class C {

	public void solve() throws FileNotFoundException {
		Scanner in = new Scanner(new File("C-small-attempt0.in"));
		PrintWriter out = new PrintWriter("C-small-attempt0.out");

		int testN = in.nextInt();

		for (int i = 1; i <= testN; i++) {
			out.print("Case #" + i + ": ");
			int a = in.nextInt();
			int b = in.nextInt();
			int recycled = 0;
			StringBuilder sb;

			if (b > 9) {
				for (int x = a; x <= b; x++) {
					sb = new StringBuilder(Integer.toString(x));

					for (int y = 0; y < sb.length() - 1; y++) {
						int v = backToFront(sb);

						recycled += isRecycled(v, x, b);
					}

				}

			}
			out.println(recycled);
		}

		in.close();
		out.close();

	}

	public int backToFront(StringBuilder sb) {

		char c = sb.charAt(sb.length() - 1);

		sb.deleteCharAt(sb.length() - 1);

		sb.insert(0, c);

		int x = Integer.parseInt(sb.toString());

		return x;
	}

	public int isRecycled(int v, int x, int b) {
		int r = 0;

		if (v > x && v <= b)
			for (int i = x; i <= b; i++) {
				if (v == i) {
					r++;
				}
			}

		return r;
	}

	public static void main(String[] args) throws FileNotFoundException {
		new C().solve();
	}
}
