import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.HashSet;

public class Recycled {
    public static void main(String[] args) {
        try {
            BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
            int t = Integer.parseInt(br.readLine());
            for (int i = 0; i < t; i++) {
                String[] str = br.readLine().split(" ");
                int a = Integer.parseInt(str[0]);
                int b = Integer.parseInt(str[1]);
                System.out.println("Case #" + (i + 1) + ": " + find(a, b));
            }
        } catch (IOException e) {
            e.printStackTrace();
        }
    }

    private static int find(int a, int b) {
        HashSet<Long> used = new HashSet<Long>();
        int digits = String.valueOf(a).length();
        if (digits == 1) return 0;
        for (int i = a; i <= b; i++) {
            int s = 10;
            int m = (int) Math.pow(10, digits-1);
            for (int j = 0; j < digits-1; j++) {
                int r = i % s;
                if (r < s/10) continue;
                int q = i / s;
                int rn = r * m + q;
                s *= 10; m /= 10;
                if (i != rn && rn >= a && rn <= b) {
                    long pp;
                    if (rn < i) pp = (long)rn << 30 | i;
                    else pp = (long)i << 30 | rn;
                    if (!used.contains(pp)) {
                        used.add(pp);
                    }
                }
            }
        }
        return used.size();
    }
}

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.HashSet;
import java.util.List;
import java.util.Set;

public class RecycledNumbers {

	public static void main(String[] args) {
		try {
			BufferedReader in = new BufferedReader(new InputStreamReader(
					System.in));
			String str = "";

			// Testcases
			str = in.readLine();
			int cases = Integer.valueOf(str);
			List<String> output = new ArrayList<String>();

			CalculatorThread[] threads = new CalculatorThread[cases];

			long start = System.nanoTime();

			for (int i = 0; i < cases; i++) {

				str = in.readLine();

				String[] numbers = str.split(" ");

				int a = Integer.valueOf(numbers[0]);
				int b = Integer.valueOf(numbers[1]);

				CalculatorThread t = new CalculatorThread(a, b);
				t.start();
				threads[i] = t;
				
				if((i + 1) % 4 == 0) {
					try {
						t.join();
					} catch (InterruptedException e) {
						// TODO Auto-generated catch block
						e.printStackTrace();
					}
				}

			}

			System.out.println("waiting for threads");
			
			for (CalculatorThread t : threads) {
				
				try {
					t.join();
				} catch (InterruptedException e) {
					// TODO Auto-generated catch block
					e.printStackTrace();
				}

			}

			for (int i = 0; i < threads.length; i++) {
				output.add("Case #" + (i + 1) + ": " + threads[i].getSolution());
			}

			long end = System.nanoTime();
			float duration = ((float) end - start) / 1000 / 1000 / 1000;
			System.out.println("Duration: " + duration);

			for (String outputLine : output) {
				System.out.println(outputLine);
			}

		} catch (IOException e) {
		}
	}

}
