import java.io.*;
import java.util.*;

class B
{
	public static void main(String[] args) 
	{
		try
		{
			BufferedReader br = new BufferedReader(new FileReader("B.in"));
			PrintWriter pw = new PrintWriter(new FileWriter("B.out"));
			int X = Integer.parseInt(br.readLine());

			for(int i=0; i<X; i++)
			{
				String[] S = br.readLine().split(" ");
				int A = Integer.parseInt(S[0]);
				int B = Integer.parseInt(S[1]);
				int R = 0;

				int x = 1;
				int n = 0;
				while(A/x > 0) {
					n++;
					x *= 10;
				}

				for(int j=A; j<B; j++) {
					Set<Integer> seen = new HashSet<Integer>();
					for(int k=1; k<n; k++) {
						int p1 = j % (int)Math.pow(10, k);
						int p2 = (int) Math.pow(10, n-k);
						int p3 = j / (int)Math.pow(10, k);
						int y = p1*p2 + p3;
						
						if(j < y && !seen.contains(y) && y <= B) {
							seen.add(y);
							R++;
						}
					}
				}

				pw.printf("Case #%d: %d\n", i+1, R);
				pw.flush();
			}
		}
		catch(Exception e)
		{ 
			e.printStackTrace();
		}
	}
}

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