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.util.Scanner;
import java.util.List;
import java.util.ArrayList;

public class Recycled{

    private Scanner input;

    private int min = 0;
    private int max = 0;
    
    private ArrayList<ArrayList<Integer>> list;

    public Recycled(){
        input = new Scanner(System.in);
        list = new ArrayList<ArrayList<Integer>>();
    }

    public void run(){
        precompute(2000000);
        int T = input.nextInt();
        for(int i = 1; i<=T; i++){
            int A = input.nextInt();
            int B = input.nextInt();
            System.out.printf("Case #%d: %d\n",i,check(A,B));
        }
    }

    public void precompute(int max){
        list.add(new ArrayList<Integer>());
        for(int i = 1; i <= max; i++){
            list.add(new ArrayList<Integer>());
            String n = String.valueOf(i);
            for(int m = 1; m<n.length(); m++){
                String temp = n.substring(m).concat(n.substring(0,m));
                if(temp.charAt(0) != '0' && !temp.equals(n) && !list.get(i).contains(Integer.valueOf(temp))){
                    list.get(i).add(Integer.valueOf(temp));
                }
            }
        }
    }

    public int check(int A, int B){
        if(A == B)
            return 0;
        int result = 0;
        for(int n = A; n < B; n++){
            for(Integer i: list.get(n)){
                if(i >= n && i <= B){
                    result++;
                }
            }
        }
        return result;
    }

    public static void main(String[] args){
        Recycled object = new Recycled();
        object.run();
    }

}
