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

import java.util.ArrayList;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;

public class Cl {
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int T = in.nextInt();

		for (int l = 1; l <= T; l++) {
			in.nextLine();
			int n = in.nextInt();
			int m = in.nextInt();
			int count = 0;
			for (int i = n; i < m; i++) {
				int uv = 0;
				for (int j = 1000000; j >= 1; j = j / 10) {
					if (m / j > 0 && m / j < 10) {
						uv = j;
					}
				}
				ArrayList revI = new ArrayList();
				int s = 10;
				for (int c = uv; c >= 10; c = c / 10) {
					int h = i / c;
					int t = i % c;
					int rev = (t * s) + h;
					s *= 10;
					revI.add(rev);
				}
				Set set = new HashSet(revI);
				for (Object j : set) {
					if (i < ((Integer) j).intValue()
							&& ((Integer) j).intValue() <= m) {
						count++;
					}
				}
			}
			System.out.format("\nCase #%d: %d", l, count);
		}		
	}
}
