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 gjc.recyclednumber;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.List;
import java.util.Set;
import java.util.StringTokenizer;

public class Solution {

	List<Integer> list = new LinkedList<Integer>();
	
	/**
	 * @param args
	 */
	public static void main(String[] args) throws IOException {
		BufferedReader br = new BufferedReader(new FileReader("C-large.in"));
		BufferedWriter bw = new BufferedWriter(new FileWriter("C-large.txt"));
		int nTestCases = Integer.parseInt(br.readLine());
		long start = System.currentTimeMillis();
		for (int i=0; i<nTestCases; i++) {
			Set<String> resultSet = new HashSet<String>();
			String line = br.readLine();
			StringTokenizer st = new StringTokenizer(line);
			String bottomStr = st.nextToken();
			int bottom = Integer.parseInt(bottomStr);
			int top= Integer.parseInt(st.nextToken());
			for (int j=bottom; j<=top; j++) {
				// Rotate and check if existing number exists.
				String jStr = j+"";
				String temp = jStr;
				for (int k=0; k<temp.length()-1; k++) {
					temp = temp.substring(1) + temp.charAt(0);
					if (!temp.startsWith("0")) {
						//int number = Integer.parseInt(temp);
						if (temp.compareTo(jStr)<0 && temp.compareTo(bottomStr)>=0) {
							String str = temp+jStr;
							if (!resultSet.contains(str)) {
								resultSet.add(str);
							}
						}
					}
				}
			}
			
			// Display the results.
			bw.write("Case #"+(i+1)+": ");
			bw.write(resultSet.size()+"\n");
		}
		bw.close();
		long end = System.currentTimeMillis();
		System.out.println("Time taken = "+(end-start)+" seconds.");
	}

}
