import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;
import java.util.Set;

public class CopyOfCopyOfMain {

	static int ndigits(int n) {
		return (int) (Math.log10(n) + 1);
	}

	static int rot(int n, int dig) {
		return (int) ((n % 10) * Math.pow(10, dig - 1)) + (int) (n / 10);
	}

	public static void main(String[] args) throws FileNotFoundException {
		String file = "C-large";
		Scanner in = new Scanner(new File(file + ".in"));
		PrintWriter out = new PrintWriter(new File(file + ".out"));

		int T = in.nextInt();
		for (int t = 1; t <= T; t++) {
			int A = in.nextInt();
			int B = in.nextInt();

			int c = 0;
			int[] list = new int[ndigits(B)];
			numbers: for (int i = A; i <= B; i++) {
				int digs = ndigits(i);
				int rot = i;
				int pairs = 0;

				Arrays.fill(list, -1);
				list[0] = i;

				digits: for (int j = 1; j <= digs + 1; j++) {

					rot = rot(rot, digs);
					if(rot < i)
						continue;

					if (A <= rot && rot <= B) {
						for (int k = 0; k < j; k++) {
							if (list[k] == rot) {
								continue digits;
							}
						}
						pairs++;
						list[j] = rot;
					}
				}

				//c += pairs * (pairs + 1) / 2;
				c += pairs ;
				// c+=digs;
			}
			out.println("Case #" + t + ": " + c);
		}

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


import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.StringTokenizer;

/**
 *
 * @author Anirban
 */
public class RecycledNumbersLarge {
    static int MAXN = 2000000;
    static int arr[] = new int[MAXN + 1];

    public static boolean check(String n, String m, int len){
        for(int i = 0; i < len; i++){
            if(m.compareTo(n.substring(i, i + len)) == 0)
                return true;
        }
        return false;
    }

    public static void main(String [] args)throws IOException{
        InputStreamReader isr = new InputStreamReader(System.in);
        BufferedReader br = new BufferedReader(isr);

        int tc = 1;

        //int T = 50;
        int T = Integer.parseInt(br.readLine());
        while(T-- > 0){

            int count = 0;
            StringTokenizer st = new StringTokenizer(br.readLine(), " ");
            int A = Integer.parseInt(st.nextToken());
            int B = Integer.parseInt(st.nextToken());

            //int A = 1;
            //int B = 2000000;
            ArrayList <Integer> L = new ArrayList<Integer>();

            String b = B + "";
            for(int i = A; i <= B; i++){
                String n = i + "";
                String x = n;
                int len = n.length();
                n += n;
                L.clear();
                for(int j = 0; j < len; j++){
                    String m = n.substring(j, j + len);
                    int mm = Integer.parseInt(m);
                    if(!L.contains(mm)){
                        m = mm + "";
                        if(i < mm && x.length() == m.length() && B >= mm){
                            count++;
                            //System.out.println(n.substring(0, len) + " " + m);
                        }
                        L.add(mm);
                    }
                }
            }
            System.out.printf("Case #%d: %d", tc, count);
            System.out.println();
            tc++;
        }
    }
}
