import java.util.HashMap;
import java.util.HashSet;
import java.util.Scanner;

public class Recycle {

	private static HashMap<Integer, HashSet<Integer>> map = new HashMap<Integer, HashSet<Integer>>();
	private static HashSet<Integer> toSkip = new HashSet<Integer>();
	/**
	 * @param args
	 */
	public static void main(String[] args) {
		Scanner reader = new Scanner(System.in);
		int T = reader.nextInt();
		for (int tc = 1; tc <= T; tc++) {
			int a = reader.nextInt();
			int b = reader.nextInt();
			long before = System.currentTimeMillis();
			int res = doit(a, b);
			System.out.printf("Case #%d: %d\n", tc, res);
			long after = System.currentTimeMillis();
//			System.out.println("time taken: " + (after - before));
		}
	}

	private static int doit(int a, int b) {
		int count = 0;
		HashSet<Integer> skip = new HashSet<Integer>(toSkip);
		for (int i = a; i <= b; i++) {
			if (skip.contains(i))
				continue;
			HashSet<Integer> arr = generate(i);
//			if(arr.size() > 1) {
//				map.put(i, arr);
//			}
			// System.out.println(i + " --> " +
			// Arrays.deepToString(arr.toArray()));
			int temp = 0;
			if (arr.size() > 1) {
				for (int x : arr) {
					if (x >= a && x <= b) {
						temp++;
						skip.add(x);
					}
				}
				count += temp * (temp - 1) / 2;
			}
//			System.out.println("not skipping " + i + " gen: " + arr.size()+ " " + (temp * (temp - 1) / 2));
		}
		return count;
	}

	private static HashSet<Integer> generate(int num) {
		if(map.containsKey(num)) {
			HashSet<Integer> list = map.get(num);
			return list;
		}
		HashSet<Integer> list = new HashSet<Integer>();
		String s = "" + num;
		list.add(num);
		int len = s.length();
		for (int i = 1; i < len; i++) {
			String temp = s.substring(i) + s.substring(0, i);
			// System.out.println("temp: " + temp);
			if (temp.charAt(0) == '0')
				continue;
			int x = Integer.parseInt(temp);
			if( x <= 2000000) {
				list.add(x);
			}
		}
		if(list.size() > 1) {
			map.put(num, list);
		} else {
			toSkip.add(num);
		}
		return list;
	}

}

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.Arrays;
import java.util.logging.Level;
import java.util.logging.Logger;

/**
 *
 * @author Ayyoob
 */
public class RecycledNumbers {

    public static void main(String[] args) {

        BufferedReader bf = null;
        BufferedWriter bw = null;
        try {
            bf = new BufferedReader(new FileReader("./C-small-attempt0.in"));
            bw =new BufferedWriter(new FileWriter("./C-small-attempt0.out"));
           int prt=Integer.parseInt(bf.readLine());
           
           for(int printer=0;printer<prt;printer++){

            String str[] = bf.readLine().split(" ");

            int first = Integer.parseInt(str[0]);
            int second = Integer.parseInt(str[1]);
            int count = 0;
            String mystr = "" + first;
            int mystr_length = mystr.length();
            int myarr[][] = new int[(second - first) + 1][mystr_length];

            for (int i = first, m = 0; i <= second; i++, m++) {

                int mytemparr[] = new int[mystr_length];
                mytemparr[0] = i;

                for (int j = 1; j < mystr_length; j++) {

                    String newstr = "" + mytemparr[j - 1];
                    while (newstr.length() != mystr_length) {
                        newstr = "0" + newstr;
                    }
                    newstr = newstr.charAt(newstr.length() - 1) + newstr.substring(0, newstr.length() - 1);
                    mytemparr[j] = Integer.parseInt(newstr);

                }
                Arrays.sort(mytemparr);

                myarr[m] = mytemparr;

            }

            for (int m = 0; m < myarr.length; m++) {
                for (int j = m + 1; j < myarr.length; j++) {
                    if (myarr[m][0] == myarr[j][0]) {
                        myarr[m][0] = -1;

                    }
                }
            }

            for (int m = 0; m < myarr.length; m++) {
                if (myarr[m][0] != -1) {
                    for (int ind = 0; ind < mystr_length-1 ; ind++) {
                        for (int ind2 = ind + 1; ind2 < mystr_length; ind2++) {
                            if (myarr[m][ind] == myarr[m][ind2]) {
                                myarr[m][ind2] = -1;

                            }
                        }
                    }
                }
            }

            if (mystr_length > 1) {

                for (int m = 0; m < myarr.length; m++) {
                    for (int j = 0; j < mystr_length; j++) {
                        if (myarr[m][0] != -1) {

                            for (int z = j + 1; z < mystr_length; z++) {
                                if (myarr[m][j] != -1) {
                                    if (myarr[m][j] >= first && myarr[m][j] <= second && myarr[m][z] >= first && myarr[m][z] <= second && myarr[m][j] != myarr[m][z] && myarr[m][z] != -1) {
                                       
                                        count++;


                                    } 

                                }
                            }

                        }
                    }
                }

            }


           
            bw.write("Case #"+(printer+1)+": "+count);
            bw.newLine();
            bw.flush();
           }
        } catch (IOException ex) {
        } finally {
            try {
                bf.close();
            } catch (IOException ex) {
            }
        }

    }
}