/*
 * 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.*;
import java.text.*;
import java.math.*;
import java.util.*;

public class J12QC implements Runnable {
	Scanner in;
	PrintWriter out;
	static String taskname = ".\\src\\C-small-attempt0";
	int test, testn, i, j, k;

	public static void main(String[] args) {
		new Thread(new J12QC()).start();
	}

	public void solve() throws Exception {
		testn = in.nextInt();
		long A,B,C,M,M2,M1;
		int n, N;
		boolean t;

		for (test = 0; test < testn; test++) {
			out.print("Case #" + (test + 1) + ": ");
			A = in.nextLong();
			B = in.nextLong();
			M=1; C=A;
			while(C>0){C/=10; M*=10;}
			M2 = (B<M)?B:M;
			N=0; M1=M/10;
			for (long i = A; i <= M2; i++) { //length = Aexp
				n = count(i,A, M2, M);
				N+= n*(n-1)/2;
			}	
			while (M*10<B){
				M1=M; M*=10;
				for (long i = M1+1; i < M-1; i++) {
					n = count(i,M1+1, M-1, M);
					N+= n*(n-1)/2;
				}
			}
			if (M<B){
				M1=M; M*=10;
				for (long i = M1+1; i <= B; i++) {
					n = count(i,M1+1, B, M);
					N+= n*(n-1)/2;
				}
			}
			
			out.print(N+"\n");
		}
	}
	public int count(long c, long M1, long M2, long M){
		int n=0;
		boolean t =true;
		long m=M/10, C=c*10%M + c*10/M;
		if(C == c) return 0;
		C=c;
		while((m/=10) >0){
			C=C*10%M + C*10/M;
			if((C < M1)||(C>M2)) continue; //or -9*exp 
			if(C < c) {t=false; break;}
			if(C == c) {break;}
			n++;
		}
		if(t) return n+1;
		else return 0;
	}

	@Override
	public void run() {
		try {
			in = new Scanner(new File(taskname + ".in"));
			out = new PrintWriter(taskname+".out");
			//out = new PrintWriter(System.out, true);
			//			in = new BufferedReader( new InputStreamReader(System.in));
			//			out = new BufferedWriter( new OutputStreamWriter(System.out));
			solve();
			out.flush();
		} catch (Exception e) {
			e.printStackTrace();
		}
	}
}
