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

import java.io.File;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;

public class RecycledNumbers {

	private static final class IntPair {
		Integer a, b;
		IntPair(Integer a,Integer b) {
			this.a = a;
			this.b = b;
		}
		@Override
		public boolean equals(Object obj) {
			IntPair other = (IntPair) obj;
			return a.equals(other.a) && b.equals(other.b);
		}
		@Override
		public int hashCode() {
			return a.hashCode() * b.hashCode();
		}
		
	}
	
	private static Map<IntPair, Object> beenThereDoneThat;
	
	public static void main(String[] args) throws IOException {
		Scanner scn = new Scanner(new File("C-large.txt"));
		PrintWriter output = new PrintWriter(new FileWriter("out2.txt"));
		int size = scn.nextInt();
		for (int i = 1; i <= size; i++) {
			int total = 0;
			int a = scn.nextInt();
			int b = scn.nextInt();
			for (int j = a; j <= b; j++) {
				total += count(j, b);
			}
			output.write("Case #" + i + ": " + total);
			output.write('\n');
		}
		output.close();
	}
	
	private static int count(Integer curr, Integer max) {
		String currString = curr.toString();
		int currSize = currString.length();
		if (currSize == 1) {
			return 0;
		}
		beenThereDoneThat = new HashMap<IntPair, Object>();
		int localCount = 0;
		//i is start index of end part, which is moving to the front
		for (int i = 1; i < currSize; i++) {
			String newCurr = currString.substring(i) + currString.substring(0, i);
			int newCurrInt = Integer.valueOf(newCurr);
			if (newCurrInt > curr && newCurrInt <= max) {
				IntPair pair = new IntPair(curr, newCurrInt);
				if (beenThereDoneThat.get(pair) == null) {
					beenThereDoneThat.put(pair, new Object());
					localCount++;
				}
				
//				if (localCount == 1) {					
//					System.out.print(curr);
//				}
//				System.out.print(" "+newCurrInt);
			}
		}
//		if (localCount !=0) {			
//			System.out.println();
//		}
		return localCount;
	}
	
	
}
