import java.util.*;
import java.io.*;

public class recycled_numbers {
	public static void main(String[]a) throws Exception{
		
		Scanner f = new Scanner(new File(a[0]));
		int result=0;
		int A,B;
		String n,m;
		HashSet<String> s=new HashSet<String>();
		
		int T=f.nextInt();	//T total case count
		for (int t=1; t<=T;t++){//for each case t
			
			s.clear();
			result=0;				//reset
			A=f.nextInt();B=f.nextInt();	//get values for next case
			
			if (A==B)result=0;//remove case not meeting problem limits 
			else{
				for(int i=A;i<=B;i++){//for each int in range
					n=Integer.toString(i);
					m=new String(n);
					//System.out.println(n);
					for (int j=1;j<n.length();j++){//move each digit to the front & test
						m = m.substring(m.length()-1)+m.substring(0,m.length()-1);
						if(m.matches("^0+[\\d]+")!=true &&
								Integer.parseInt(m)<=B &&
								Integer.parseInt(n)<Integer.parseInt(m)){
							s.add(new String(n+","+m));
							//result++;
							//System.out.println(" matched: "+m);
						}
						
					}
				}
				result = s.size();
			}

			//display output
			System.out.println("Case #" + t + ": " + result);
		}
	}
}
import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.*;

/**
 * @author rohitkg
 */
public class Task implements Runnable {
    private static final String TASK_ID = "C-large";
    private static final String IN_FILE = TASK_ID + ".in";
    private static final String OUT_FILE = TASK_ID + ".out";

    private Scanner in;
    private PrintWriter out;
    int n,i,t,A,B;
    
    int res;
   

    private void init() {
        try {
            in = new Scanner(new File(IN_FILE));
        } catch (FileNotFoundException ignored) {}
        try {
            out = new PrintWriter(OUT_FILE);
        } catch (FileNotFoundException ignored) {}
        
        n = in.nextInt();
    }

    private void read() {
        A=in.nextInt();
        B=in.nextInt();
    }

    private void solve() {
		res=0;
		
		if(A<10)
			return;
			
		HashSet<String> set=new HashSet<String>();	
		
		for(int i=A;i<=B;i++){
			String num ="" + i;
			int length=num.length();
			for(int pos=1;pos<=length;pos++){
				String recNum=num.substring(pos) + num.substring(0,pos);
				int recInt=Integer.parseInt(recNum);
				if(recInt>i && recInt<= B){
					//res++;
					
					if(!(set.contains(i + ", " +recInt) || set.contains(recInt + ", " + i))){
						set.add(i + ", " +recInt);
					}
					//	System.out.println(i + ", " +recInt);
					//else
							
					
					//out.println("Pairs : " + i + ", " + recInt);
				}
					
			}	
		}       
			
		res=set.size();	
    }

    private void write() {
        out.println("Case #" + t + ": " + res);
    }

    public void run() {
        init();
        for (t = 1; t <= n; t++) {
            read();
            solve();
            write();
        }
        out.close();
    }
    public static void main(String[] args) {
        new Thread(new Task()).start();
    }
}
