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;


public class C {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int t = sc.nextInt();
        for (int i = 0; i < t; i++) {
            int a = sc.nextInt();
            int b = sc.nextInt();
            int count = 0;
            
            int digits = 0;
            int max = 1;
            int ac = a;
            while(ac > 0) {
                ac /= 10;
                digits++;
                max *= 10;
            }
            int min = max / 10;
            ac = a;
            
            for (int j = a; j < b; j++) {
                if (j == max) {
                    digits++;
                    max *= 10;
                    min *= 10;
                }
                count += getNumPair(j, b, digits, min);
            }
            System.out.println("Case #" + (i+1) + ": " + count);
            
        }
    }

    static final int[] temp = new int[10];
    
    private static int getNumPair(int i, int b, int digits, int min) {
        int ac = i;
        int numKouho = 0;
        int count = 0;
        ddd: for (int k = 0; k < digits - 1; k++) {
            i = i % min * 10 + i / min;
            if (ac < i && i <= b) {
                for (int j = 0; j < numKouho; j++) {
                    if (temp[j] == i) continue ddd;
                }
                temp[numKouho++] = i;
                count++;
            }
        }
        return count;
    }

}
