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.util.*;


import java.util.*;
public class soalC{

	public static void main(String[] args){
			Scanner scan=new Scanner(System.in);



			int tc = scan.nextInt();

			for (int i = 0 ; i <  tc; i++)
			{
				int awal = scan.nextInt();
				int akhir = scan.nextInt();

				int index = awal;
				int count = 0;

				for (int j = awal; j <= akhir ; j++)
				{
					for (int k = j+1; k <= akhir ; k++)
					{
						if (checkRecycle(j,k))
						{
							count++;
						}

					}

				}

				System.out.println("Case #"+(i+1)+": "+count);


			}
	}

	public static boolean checkRecycle(int m, int n)
	{
		String x = n+"";
		for (int i = 0 ; i < x.length() ; i++)
		{
			if (Integer.parseInt(x.substring(i,x.length())+(x.substring(0,i)))==m)
			{
				return true;
			}
		}


		return false;
	}

}



