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();
	}
}

public class Recycle extends CodeJam{

    public Recycle() {
        super("C-large");
    }

    public static void main(String[] args) {
        //long t = System.currentTimeMillis();
        new Recycle().run();
        //System.out.println(System.currentTimeMillis() - t);
    }
    
    private int[][] nm = new int[2000001][10];
    
    public void init() {
        //long t = System.currentTimeMillis();
        int k10 = 10;
        for (int n = 1 ; n < 2000001; n++){
            int[] mar = new int[10];
            if (n == k10){
                k10 *= 10;
            }
            int d = 10;
            int a = n / d;
            for (int i = 0 ; a > 0 ; i++, d *= 10, a /= 10){
                int b = n % d;
                int m = (k10/d) * b + a;
                if (m > n){
                    boolean add = true;
                    for (int exists : mar){
                        if (exists == m){
                            add = false;
                            break;
                        }
                    }
                    if (add) {
                        mar[i] = m;
                    }
                }
                
            }
            nm[n] = mar;
        }
        //System.out.println(System.currentTimeMillis() - t);
    }

    @Override
    protected String solve() {
        int A = scanner.nextInt();
        int B = scanner.nextInt();
        int count = 0;
        for (int n = A ; n < B; n++) {
            for (int m : nm[n]) {
                if (m > 0 && m <= B){
                    count++;
                }
            }    
        }
        return count + "";
    }
}
