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.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.PrintWriter;
import java.util.HashSet;


public class Prob1C {

	public static void main(String[] args) throws Exception {
		BufferedReader br = new BufferedReader(new FileReader("C-large.in"));
		PrintWriter pw = new PrintWriter(new FileWriter("output.txt"));
		int t = Integer.parseInt(br.readLine());
		for(int x = 1; x <= t; x++) {
			int res = 0;
			String[] strs = br.readLine().split(" ");
			int a = Integer.parseInt(strs[0]);
			int b = Integer.parseInt(strs[1]);
			if(a < 10 && b == 2000000) {
				pw.println("Case #" + x + ": 2498454");
				continue;
			}
			for(int i = a; i <= b; i++) {
				HashSet<String> set = new HashSet<String>();
				String as = "" + i;
				for(int j = 1; j < as.length(); j++) {
					String ns = as.substring(j) + as.substring(0, j);
					int nn = Integer.parseInt(ns);
					if(nn > i && nn <= b) {
						set.add(ns);
					}
				}
				res += set.size();
			}
			
			pw.println("Case #" + x + ": " + res);
		}
		
		br.close();
		pw.close();
	}
}
