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

import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.HashSet;
import java.util.Scanner;

public class RecycledNumbers {
	private String solve(Scanner in) {
		HashSet<Integer> set = new HashSet<Integer>();
		int A = in.nextInt();
		int B = in.nextInt();
		
		int result = 0;
		int numberLen = ((Integer)A).toString().length();
		
		int multiple = 1;
		for (int tt = 1; tt < ((Integer)A).toString().length(); tt++)
			multiple *= 10;
		
		for (int n = A; n < B; n++) {
			if (n / multiple >= 10) multiple *= 10;

			int m = n;
			int d = m % 10;
			m /= 10;
			
			int counter = 0;
			while (counter < numberLen - 1) {
				m += multiple*d;
				if (m > n && m <= B && !set.contains(m)) set.add(m);
				d = m % 10;
				m = m / 10;
				counter++;
			}
			
			result += set.size();
			set.clear();
		}
		return "" + result;
	}
	
	
	/**
	 * @param args
	 * @throws FileNotFoundException 
	 */
	public static void main(String[] args) throws FileNotFoundException {
	    Scanner in = new Scanner(new File("C:\\Users\\User\\Desktop\\dane\\data.in"));//C:\\Users\\User\\workspace\\GoogleCodeJam\\src\\gcj\\data"));//"));
	    PrintWriter out = new PrintWriter("C:\\Users\\User\\Desktop\\dane\\output");//C:\\Users\\User\\workspace\\GoogleCodeJam\\src\\gcj\\output");//"C:\\Users\\User\\Desktop\\dane\\output");
		
	    int T = in.nextInt();
	    in.nextLine();
	
        for (int i = 0; i < T; i++) {
            String s = "Case #" + (i + 1) + ": " + new RecycledNumbers().solve(in);
            out.println(s);
            System.out.println(s);
        }
        out.close();

	}
}
