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

package cj2012.qual;

import java.io.File;
import java.io.PrintWriter;
import java.util.Scanner;
import java.util.TreeSet;

public class C {
	public static void main(String[] args) throws Exception {
		Scanner scan = new Scanner(new File("in/C-large.in"));
		int T = scan.nextInt();
		PrintWriter out = new PrintWriter(new File("out/C-large.txt"));
		for (int z = 1; z <= T; z++) {
			int A = scan.nextInt();
			int B = scan.nextInt();
			int D = 1 + (int) Math.log10(B);
			int C = (int) Math.pow(10, D - 1);
			int res = 0;
			TreeSet<Integer> set = new TreeSet<Integer>();
			for (int n = A; n <= B; n++) {
				for (int s = 1; s < D; s++) {
					int m = n;
					for (int k = 0; k < s; k++)
						m = (m % 10) * C + (m / 10);
					if (m < A || m > B || n >= m) continue;
					set.add(m);
				}
				res += set.size();
				set.clear();
			}
			out.println("Case #" + z + ": " + res);
		}
		out.close();
	}
}
