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);

			}
		}

	}
}

// usage: java c infile > outfile
import java.io.BufferedReader;
import java.io.FileReader;
import java.util.Set;
import java.util.HashSet;

public class c
{
	public static void main(String[] args) throws Exception
	{
		String infile = args[0];
		
		BufferedReader reader = new BufferedReader(new FileReader(infile));
		int T = Integer.parseInt(reader.readLine());
		for (int t = 1; t <= T; t++)
		{
			Set<String> pairs = new HashSet<String>();
			String[] inputs = reader.readLine().split(" ");
			int A = Integer.parseInt(inputs[0]);
			int B = Integer.parseInt(inputs[1]);
			int length = inputs[0].length();
			//System.out.println("test = " + A + ", " + B + ", " + length);
			
			int total = 0;
			for (int i = A; i <= B; i++)
			{
				String trial = "" + i;
				//System.out.println("i = " + i);
				for (int n = 1; n < length; n++)
				{
					int j = Integer.parseInt(trial.substring(n) + trial.substring(0, n));
					//System.out.println(trial.substring(n) + ":" + trial.substring(0, n));
					if (trial.charAt(n) == '0')
					{
						continue;
					}
					
					String pair = i + " " + j;
					if (i < j && j <= B && !pairs.contains(pair))
					{
						total++;
						pairs.add(pair);
					}
				}
			}
			
			System.out.println("Case #" + t + ": " + total);
		}
		reader.close();
	}
}
