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.awt.print.Printable;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileWriter;
import java.io.IOException;
import java.util.Scanner;


public class C {
    public static void main(String[] args) throws IOException {
        Scanner scanner = null;
        scanner = new Scanner(new File("C-large.in"));
//        scanner = new Scanner(System.in);
        FileWriter writer = new FileWriter("C.out");
        int t = scanner.nextInt();
        for (int tt = 1; tt <= t ; tt ++ ) {
            int a = scanner.nextInt();
            int b = scanner.nextInt();
            
            String str;
            int k;
            int ans = 0;
            String tmp;
            for (int i = a; i <= b; i ++) {
                str = Integer.toString(i);
                if (str.length() > 1) {
                    for (int j = 1; j < str.length(); j++) {
                        tmp = str.substring(j, str.length())
                        + str.substring(0,j);
                        if (tmp.startsWith("0")) continue;
                        k = Integer.parseInt(tmp);
                        if (k >=a && k <= b && k > i) ans ++;
                    }
                }
            }
            
            writer.write(String.format("Case #%d: %d\n", tt,ans));
            System.out.println(String.format("Case #%d: %d\n", tt,ans));
        }
        writer.close();
    }

}
