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 com.code.jam;

import java.io.File;
import java.io.PrintStream;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;

import org.apache.commons.lang.StringUtils;

public class CRecycledNumbers {
	public static void main(String[] args) throws Exception {
		Scanner in = new Scanner (new File("C:/codeJam/ficheros2012/CRecycledNumbers.in"));
		PrintStream ps = new PrintStream("C:/codeJam/ficheros2012/CRecycledNumbers.out");
		int T = new Integer (in.nextLine());
		for (int nCase = 1; nCase < T + 1; nCase++) {
			Scanner inLine = new Scanner (in.nextLine());
			int recycledPair = 0;
			int A = inLine.nextInt();
			int B = inLine.nextInt();
			int lengthI = String.valueOf(A).length();
			
			if (lengthI > 1){
				for (int n = A; n <= B; n++){
					int operatorGetLeftRight = 1;
					int operatorNewNumber = Integer.valueOf(StringUtils.rightPad("1", lengthI + 1, '0'));
					Set<Integer> isRepeted = new HashSet<Integer>();
					for (int j = 1; j < lengthI; j++) {
						operatorGetLeftRight *= 10;
						operatorNewNumber /= 10;
						int newLeft = n % operatorGetLeftRight;
						int newRight = (n - newLeft) / operatorGetLeftRight;
						int m = newLeft * operatorNewNumber + newRight;
						if ( !(isRepeted.contains(m)) 
								&& (m >= A) 
								&& (m <= B) 
								&& (n < m)){
							isRepeted.add(m);
							recycledPair++;
						}
					}
				}
			}
			System.out.format("Case #%d: %d\n", nCase, recycledPair);
			ps.format("Case #%d: %d\n", nCase, recycledPair);
		}
		ps.flush();
		ps.close();
	}
}
