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.util.*;
public class C {
	public static void main (String [] arg) {
		
		int [][] store = new int [2000010][7];
		for (int i = 1; i<store.length; ++i) {
			int ptr = 0;
			int j = rotate(i);
			while (j != i) {
				if (j > i) store[i][ptr++] = j;
				j = rotate(j);
			}
		}
		Scanner sc = new Scanner(System.in);
		int T = Integer.parseInt(sc.nextLine());
		for (int ii = 1; ii<=T; ++ii) {
			//Something
			int A = sc.nextInt();
			int B = sc.nextInt();
			int count = 0;
			for (int a = A; a<B; ++a)
				for (int i = 0; i<store[a].length && store[a][i] > 0; ++i) 
					if (store[a][i] <= B) count++;
			
			
			int ans = count;
			System.out.printf("Case #%d: %s\n",ii,ans);
		}
	}
	public static int rotate(int a) {
		String s = Integer.toString(a);
		do {
			s = s.substring(1) + s.charAt(0);
		} while (s.charAt(0) == '0');
		
		return Integer.parseInt(s);
	
	}
	
}