import java.util.HashSet;
import java.util.Scanner;

public class C {

	static HashSet p = new HashSet();
	static int low;
	static int high;
	int count = 0;

	public static void main(String[] args) {

		Scanner sc = new Scanner(System.in);
		int no = sc.nextInt();

		for (int i = 1; i <= no; i++) {

			p.clear();
			low = sc.nextInt();
			high = sc.nextInt();

			for (int l = low; l <= high; l++) {
				recycle(l);
			}
			System.out.println("Case #" + i + ": " + p.size());

		}
	}

	public static void recycle(int no) {

		String s = Integer.toString(no);
		for (int i = 0; i < s.length(); i++) {
			String rec = s.substring(i) + s.substring(0, i);
			int r = Integer.parseInt(rec);
			if (r != no && r >= low && r <= high) {
				int min = Math.min(r, no);
				int max = Math.max(r, no);
				String a = Integer.toString(min) + "" + Integer.toString(max);
				p.add(a);

			}
		}

	}
}

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

public class ProblemC {
	public static void main(String[] args) {
		try {
			Set<Integer> alltuples = new HashSet<Integer>();

			PrintWriter fout = new PrintWriter(new FileWriter("CJ"));
			BufferedReader fin = new BufferedReader(new FileReader("C-large.in"));

			String l;
			String[] p;
			Integer i, j, k, m, n, ans,tests = Integer.valueOf(fin.readLine());
			for(i = 1; i <= tests; ++i) {
				ans = 0;
				p = fin.readLine().split(" ");
				j = Integer.valueOf(p[0]);
				k = Integer.valueOf(p[1]);
				for(j = j; j < k; ++j) {
					alltuples.clear();
					l = j.toString();
					for(m = 1; m < l.length(); ++m) {
						n = Integer.valueOf(l.substring(m) + l.substring(0,m));
						if(n > j && n <= k)
							alltuples.add(n);
					}
					ans += alltuples.size();
				}
				fout.println("Case #" + i +": " + ans);
			}

			fin.close();
			fout.close();
		} catch (Exception e) {
			e.printStackTrace();
		}
	}
}
