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

class C1Large
{
	public static void main(String[] args) throws Exception 
	{
		FileInputStream fis = new FileInputStream("C-large.in");
		Scanner scan = new Scanner(fis);
		FileWriter fw = new FileWriter("output.txt");
		int T = scan.nextInt();
		for(int c = 1; c<=T;c++)
		{
			long A = scan.nextInt();
			long B = scan.nextInt();
			int digit = String.valueOf(A).length();
			int count=0;
			
			for(long i=A;i<=B;i++)
			{
				String mut = String.valueOf(i);
				long tmp =0;
				long[] mem = new long[digit];
				boolean counted = false;
				for(int j=1;j<digit;j++)
				{
					tmp = Long.parseLong(mut.substring(j,digit) + (mut.substring(0,j)));
					mem[j-1] = tmp;
					counted = false;
					if(tmp > Long.parseLong(mut) && tmp >=A && tmp <=B)
					{
						for(int k=0;k<j-1;k++)
						{
							if(mem[k] == tmp)
							{	
								counted = true;
								break;
							}
						}
						if(!counted)
						{
//							System.out.println("counted :"+ A + "<=" +mut +"<"+ tmp +"<=" +B);
							count++;
						}
					}
				}
			}
			if(digit > 1 )
				fw.write("Case #" +c +": "+ count +"\n");
			else
				fw.write("Case #" +c +": "+ 0 +"\n");
		}
		fw.close();
	}
}