package codejam;

import java.util.*;
import java.io.*;

public class RecycledNumbers {
	public static void main(String[] args) throws IOException {
		BufferedReader in = new BufferedReader(new FileReader("in.txt"));
		PrintWriter out = new PrintWriter(new File("out.txt"));
		
		int T = Integer.parseInt(in.readLine());
		for (int t = 1; t <= T; ++t) {
			String[] parts = in.readLine().split("[ ]+");
			int A = Integer.parseInt(parts[0]);
			int B = Integer.parseInt(parts[1]);
			
			int cnt = 0;
			for (int i = A; i < B; ++i) {
				String str = String.valueOf(i);
				int n = str.length();
				String res = "";
				Set<Integer> seen = new HashSet<Integer>();
				for (int j = n - 1; j > 0; --j) {
					res = str.substring(j) + str.substring(0, j);
					int k = Integer.parseInt(res);
					if (k > i && k <= B) {
						//System.out.println("(" + i + ", " + k + ")");
						if (!seen.contains(k)) {
							++cnt;
							seen.add(k);
						}
					}
				}
			}

			out.println("Case #" + t + ": " + cnt);
		}
		
		in.close();
		out.close();
		System.exit(0);
	}
}

import java.io.*;
import java.util.*;

public class RecycledNumbers {

	BufferedReader in;
	StringTokenizer st;
	PrintWriter out;

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

	int nextInt() throws Exception {
		return Integer.parseInt(next());
	}

	long nextLong() throws Exception {
		return Long.parseLong(next());
	}

	double nextDouble() throws Exception {
		return Double.parseDouble(next());
	}

	void solve() throws Exception {
		int l = nextInt(), r = nextInt();

		HashMap<Integer, Integer> c = new HashMap<Integer, Integer>();

		for (int i = l; i <= r; i++) {
			HashSet<Integer> alr = new HashSet<Integer>();
			alr.add(i);
			for (int j = 10; j <= i; j *= 10) {
				int rot = Integer.parseInt((i % j) + "" + (i / j));
				if (!alr.contains(rot)) {
					alr.add(rot);
					if (c.containsKey(rot)) {
						int curr = c.get(rot) + 1;
						c.put(rot, curr);
					} else
						c.put(rot, 1);
				}
			}
		}

		long ans = 0;
		for (int i = l; i <= r; i++) {
			ans += c.get(i) == null ? 0 : c.get(i);
		}

		out.print(ans / 2);
	}

	void run() {
		try {
			Locale.setDefault(Locale.US);
			in = new BufferedReader(new FileReader("input.txt"));
			out = new PrintWriter(new FileWriter("output.txt"));
			int t = nextInt();
			for (int tc = 1; tc <= t; tc++) {
				out.print("Case #" + tc + ": ");
				solve();
				out.println();
			}
			out.close();
		} catch (Exception e) {
			e.printStackTrace();
			System.exit(1);
		}
	}

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

	}

}
