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.*;
public class Main {
	public static void main(String[] args) {
		try{
			FileReader in = new FileReader("input.txt");
			BufferedReader inFile = new BufferedReader(in);
			FileWriter outFile = new FileWriter("output.txt");
			int test = Integer.parseInt(inFile.readLine());
			for(int i=1;i<=test;i++){
				String line = inFile.readLine();
				String values[]=line.split(" ");
				int A = Integer.parseInt(values[0]);
				int B = Integer.parseInt(values[1]);
				int count = 0;
				for(int j=A;j<B;j++){
					for(int k=j+1;k<=B;k++){
						String temp = (new Integer(j)).toString();
						temp=(temp+temp);
						if(temp.contains((new Integer(k)).toString())) count++;
					}
				}
				outFile.write("Case #" + i + ": " + count + "\n");
			}
			inFile.close();
			outFile.close();
			
		}catch(Exception exp){
			exp.printStackTrace();
		}
	}
}
