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.BufferedWriter;
import java.io.File;
import java.io.FileWriter;
import java.io.IOException;
import java.util.HashSet;
import java.util.Scanner;


public class C {
	
	public static void main(String[] args) {
		
		try {
			Scanner in = new Scanner(new File("C.in"));
			BufferedWriter writer = new BufferedWriter(new FileWriter(new File("C.out")));
			
			int T = in.nextInt();
			in.nextLine();
			
			for (int i=0; i<T; i++) {
				
				int A = in.nextInt();
				int B = in.nextInt();
				
				long res = 0;
				
				for (int X=A; X<B; X++) {
					
					int D = digits(X);
					HashSet<Integer> set = new HashSet<Integer>();
					
					for (int j=1; j<D; j++) {
						int C = moveLast(X, j);
						
						if (C > X && C <= B && !(set.contains(C))) {
							set.add(C);
							res++;
							//System.out.println("X="+X + ",     C="+C);
						}
					}
				}
				
				writer.append("Case #" + (i+1) + ": " + res + "\n");
			}
			
			writer.close();
			
		}
		catch (IOException e) {
			e.printStackTrace();
		}
	}
	
	public static int moveLast(int X, int digits) {
		
		int last = 0;
		int p = 1;
		int p2 = 1;
		
		for (int i=0; i<digits; i++) p *= 10;
		
		last = X % p;
		
		while ((p2*10)<=X) p2 *= 10;
		
		return last*(p2/p)*10 + (X / p); 
	}
	
	public static int digits(int X) {
		int k = 0;
		
		while (X > 0) {
			X /= 10;
			k++;
		}
		
		return k;
	}
}
