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.File;
import java.io.FileReader;
import java.io.PrintWriter;
import java.util.Scanner;

public class Recycled implements Runnable {
    static final int MAX = 2000000;
    public void run(){
        try {
            Scanner in = new Scanner(new File("C-large.in"));
            PrintWriter out = new PrintWriter(new File("c.out"));
            int testNum = in.nextInt();
            for (int test = 1; test <= testNum; test++) {
                //System.out.println("!!! new test");
                int a = in.nextInt();
                int b = in.nextInt();
                int p = 0;
                int k = 1;
                boolean[] u = new boolean[MAX + 1];
                while (a > k * 10) {
                    p++;
                    k *= 10;
                }
                long res = 0;
                for(int i = a; i <= b; i++) {
                    //System.out.println("in " + i);
                    if (u[i]) {
                        //System.out.println("  skipped");
                        continue;
                    }
                    u[i] = true;
                    if (i == k * 10) {
                        p++;
                        k *= 10;
                    }
                   // System.out.println("  p = " + p);
                    int ll = 1;
                    int ii = i;
                    for (int j = 0; j < p; j++) {
                        ii = (ii / 10) + (ii % 10) * k;
                        //System.out.println("  found " + ii);
                        if (a <= ii && ii <= b) {
                            if (u[ii]) continue;
                            //System.out.println("    ok");
                            u[ii] = true;
                            ll++;
                        }
                    }
                    //System.out.println(" ll = " + ll);
                    res += ll * (ll - 1) / 2;
                }
                out.println("Case #" + test + ": " + res);
            }
            out.close();
        } catch (Exception e) {
            e.printStackTrace();
        }
    }

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