import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;
import java.util.Set;

public class CopyOfCopyOfMain {

	static int ndigits(int n) {
		return (int) (Math.log10(n) + 1);
	}

	static int rot(int n, int dig) {
		return (int) ((n % 10) * Math.pow(10, dig - 1)) + (int) (n / 10);
	}

	public static void main(String[] args) throws FileNotFoundException {
		String file = "C-large";
		Scanner in = new Scanner(new File(file + ".in"));
		PrintWriter out = new PrintWriter(new File(file + ".out"));

		int T = in.nextInt();
		for (int t = 1; t <= T; t++) {
			int A = in.nextInt();
			int B = in.nextInt();

			int c = 0;
			int[] list = new int[ndigits(B)];
			numbers: for (int i = A; i <= B; i++) {
				int digs = ndigits(i);
				int rot = i;
				int pairs = 0;

				Arrays.fill(list, -1);
				list[0] = i;

				digits: for (int j = 1; j <= digs + 1; j++) {

					rot = rot(rot, digs);
					if(rot < i)
						continue;

					if (A <= rot && rot <= B) {
						for (int k = 0; k < j; k++) {
							if (list[k] == rot) {
								continue digits;
							}
						}
						pairs++;
						list[j] = rot;
					}
				}

				//c += pairs * (pairs + 1) / 2;
				c += pairs ;
				// c+=digs;
			}
			out.println("Case #" + t + ": " + c);
		}

		in.close();
		out.close();
	}
}

import java.io.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.HashSet;
import java.util.Scanner;


public class C {

	public final String INPUT_FILE_NAME = "c_in";
	public final String OUTPUT_FILE_NAME = "c_out";
	
	int kase = 1;
	int T = 0;
	int a,b;
	public void run() throws IOException{
		Scanner s = new Scanner(new File(INPUT_FILE_NAME));
		PrintWriter pw = new PrintWriter(new FileWriter(OUTPUT_FILE_NAME));
		//PrintWriter pw = new PrintWriter(new OutputStreamWriter(System.out));
		
		T = s.nextInt();
		while (T-- > 0){
			a = s.nextInt();
			b = s.nextInt();
			int len = ("" + a).length();
			
			int ans = 0;
			for (int i = a; i <=b ; i++) {
				String s1 = i + "";
				String temp = "";
				for (int k = 1; k < s1.length() ; k++) {
					temp = s1.substring(s1.length() - k) + s1.substring(0,s1.length()-k);
					int r1 = Integer.parseInt(temp); 
					if (r1 > i && r1 <= b)
						ans++;
				}
			}
			
			pw.println("Case #" + kase + ": " + ans);
			kase++;
		}
		
		pw.close();
		s.close();
	}
	
	
	public static void main(String[] args) throws IOException {
		(new C()).run();
	}

}
