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.*;
import java.util.*;

public class RecycledNumbers implements Runnable {
	public static void main(String[] args) throws IOException {
		new Thread(new RecycledNumbers()).start();
	}

	public BufferedReader br;

	public StringTokenizer in;

	public PrintWriter out;

	public String nextToken() throws IOException {
		while (in == null || !in.hasMoreTokens()) {
			in = new StringTokenizer(br.readLine());
		}

		return in.nextToken();
	}

	public int nextInt() throws IOException {
		return Integer.parseInt(nextToken());
	}

	int[] was;
	int[] count;
	long ans;

	int A, B;

	public void go(int i, int c) {
		if (i < A || i > B)
			return;

		if (was[i] > 0)
			return;

		ans += count[c];
		was[i] = c;
		count[c]++;
		String s = "" + i;
		for (int j = 0; j < s.length() - 1; j++) {
			String t = s.substring(j + 1) + s.substring(0, j + 1);
			if (t.charAt(0) != '0') {
				go(Integer.parseInt(t), c);
			}
		}
	}

	public void solve() throws IOException {
		A = nextInt();
		B = nextInt();
		was = new int[2000001];
		count = new int[2000001];

		ans = 0;

		int c = 0;
		for (int i = A; i <= B; i++) {
			if (was[i] == 0) {
				c++;
				go(i, c);
			}
		}

		out.println(ans);
	}

	public void run() {
		try {
			br = new BufferedReader(new FileReader("C-small.in"));
			out = new PrintWriter("c.out");

			int t = nextInt();
			for (int i = 0; i < t; i++) {
				System.err.println(i);
				out.print("Case #" + (i + 1) + ": ");
				solve();
			}

			out.close();
		} catch (IOException e) {
			e.printStackTrace();
			System.exit(1);
		}
	}
}
