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 ProblemC {
	public static void main(String[] args) {
		try {
			// Create file
			FileWriter fstream = new FileWriter("out.txt");
			BufferedWriter out = new BufferedWriter(fstream);
			// Close the output stream
			Scanner in = new Scanner(System.in);
			int count = in.nextInt();
			for (int i=1; i<=count; i++){
				int A = in.nextInt();
				int B = in.nextInt();
				int ret = 0;
				for (int j=A; j<B; j++){
					for (int k=j+1; k<=B; k++){
						if (areRecycledPair(j,k)) ret++;
					}
				}
				String s = "Case #" + i + ": " + ret + "\n";
				out.write(s);
			}
			
			
			
			out.close();
		} catch (Exception e) {// Catch exception if any
			System.err.println("Error: " + e.getMessage());
		}
	}
	
	public static boolean areRecycledPair(int A, int B){
		String a = A + "";
		String b = B + "";
		for (int i=0; i<a.length(); i++){
			a = a.charAt(a.length()-1) + a.substring(0,a.length() - 1);
			if (a.equals(b)) return true;
		}
		return false;
	}
}

