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

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.HashSet;
import java.util.List;
import java.util.Set;

public class RecycledNumbers {

	public static void main(String[] args) {
		try {
			BufferedReader in = new BufferedReader(new InputStreamReader(
					System.in));
			String str = "";

			// Testcases
			str = in.readLine();
			int cases = Integer.valueOf(str);
			List<String> output = new ArrayList<String>();

			CalculatorThread[] threads = new CalculatorThread[cases];

			long start = System.nanoTime();

			for (int i = 0; i < cases; i++) {

				str = in.readLine();

				String[] numbers = str.split(" ");

				int a = Integer.valueOf(numbers[0]);
				int b = Integer.valueOf(numbers[1]);

				CalculatorThread t = new CalculatorThread(a, b);
				t.start();
				threads[i] = t;
				
				if((i + 1) % 4 == 0) {
					try {
						t.join();
					} catch (InterruptedException e) {
						// TODO Auto-generated catch block
						e.printStackTrace();
					}
				}

			}

			System.out.println("waiting for threads");
			
			for (CalculatorThread t : threads) {
				
				try {
					t.join();
				} catch (InterruptedException e) {
					// TODO Auto-generated catch block
					e.printStackTrace();
				}

			}

			for (int i = 0; i < threads.length; i++) {
				output.add("Case #" + (i + 1) + ": " + threads[i].getSolution());
			}

			long end = System.nanoTime();
			float duration = ((float) end - start) / 1000 / 1000 / 1000;
			System.out.println("Duration: " + duration);

			for (String outputLine : output) {
				System.out.println(outputLine);
			}

		} catch (IOException e) {
		}
	}

}
