import java.util.HashSet;
import java.util.Scanner;

public class C {

	static HashSet p = new HashSet();
	static int low;
	static int high;
	int count = 0;

	public static void main(String[] args) {

		Scanner sc = new Scanner(System.in);
		int no = sc.nextInt();

		for (int i = 1; i <= no; i++) {

			p.clear();
			low = sc.nextInt();
			high = sc.nextInt();

			for (int l = low; l <= high; l++) {
				recycle(l);
			}
			System.out.println("Case #" + i + ": " + p.size());

		}
	}

	public static void recycle(int no) {

		String s = Integer.toString(no);
		for (int i = 0; i < s.length(); i++) {
			String rec = s.substring(i) + s.substring(0, i);
			int r = Integer.parseInt(rec);
			if (r != no && r >= low && r <= high) {
				int min = Math.min(r, no);
				int max = Math.max(r, no);
				String a = Integer.toString(min) + "" + Integer.toString(max);
				p.add(a);

			}
		}

	}
}

import java.io.*;
import java.util.HashMap;
class probC{
	public static void main(String[] args){
		Code b=new Code();
	}
}
class Code{
	public Code(){
		try {
			FileWriter fstream = new FileWriter("output.txt");
			BufferedWriter out = new BufferedWriter(fstream);

			File fin = new File("C-large.in");
			FileReader fr = new FileReader(fin);
			BufferedReader reader = new BufferedReader(fr);

			int t = Integer.parseInt(reader.readLine());

			for (int qq=0;qq<t;qq++){

				String soal=reader.readLine();
				System.out.println(qq+" "+soal);
				int jwb=0;

				String[] agg=soal.split(" ");
				int awal=Integer.parseInt(agg[0]);
				int akhir=Integer.parseInt(agg[1]);

				for (int i=awal;i<=akhir;i++){
					String ck=i+"";
					int pjg=ck.length();
					int cek=Integer.parseInt(ck);

					for (int j=0;j<pjg;j++){
						if (cek>i && cek<=akhir){
							jwb++;
						}
						ck=ck.substring(1)+ck.charAt(0);
						cek=Integer.parseInt(ck);
					}
				}

				out.write("Case #"+(qq+1)+": "+jwb+"\n");

			}

			reader.close();
			out.close();
		} catch (Exception e) {
			System.err.println(e.getMessage());
        }
	}

}