import java.util.Scanner;
import java.io.*;
import java.lang.Math;


public class C{
	public static int recycle(String str){
		String[] numbers = str.split(" ");
		int min = Integer.parseInt(numbers[0]);
		int max = Integer.parseInt(numbers[1]);
		int ret = 0;

		for(int i = min; i < max; i++){
			String num = i + "";
			int len = num.length();
			int k = i;
			for(int j = 1; j < len; j++){
				k = (k/10) + (int)java.lang.Math.pow(10.0,(double)(len-1))*(k%10);
				if (k > i && k <= max)
					ret++;
				else if(k == i)
					break;
			}
		}

		return ret;
	}

	public static void main(String[] args){
		Scanner sc = null;
		String next;
		int out;
		try{
			sc = new Scanner(new File("C-large.in"));
			int cases = Integer.parseInt(sc.nextLine());
			int current = 0;
			

			FileWriter fs = new FileWriter("output.txt");
			BufferedWriter buff = new BufferedWriter(fs);
			while(current < cases){
				next = sc.nextLine();
				current++;
				out = recycle(next);
				buff.write("Case #" + current + ": " + out + "\n");
			}
			buff.close();
		}
		catch(Exception ex){}
	}
}
package Qualification_Round_2012;

import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.HashSet;
import java.util.StringTokenizer;

public class C {

    public static void main(String[] args) throws FileNotFoundException, IOException {
        BufferedReader in = new BufferedReader(new FileReader("C-large.in"));
        PrintWriter out = new PrintWriter("c.out");
        StringTokenizer k;
        int t,a,b,x,y,count;
        HashSet<Integer> h;
        String s;
        int ar [] = new int[7];
        ar[0]=1;
        ar[1]=10;
        ar[2]=100;
        ar[3]=1000;
        ar[4]=10000;
        ar[5]=100000;
        ar[6]=1000000;
        t=Integer.parseInt(in.readLine().trim());
        for (int i = 1; i <= t; i++) {
            count=0;
            k=new StringTokenizer(in.readLine());
            a=Integer.parseInt(k.nextToken());
            b=Integer.parseInt(k.nextToken());
            for (int j = a; j <= b; j++) {
                h=new HashSet<Integer>(6);
                x=j;
                s=j+"";
                for (int l = 0; l < s.length()-1; l++) {
                    y=x%10;
                    y*=ar[s.length()-1];
                    y+=x/10;
                    if(y>j && y<=b && y!=x){
                        if(h.add(y))
                            count++;
                    }
                    x=y;
                }
            }
            out.append("Case #"+i+": "+count+"\n");
        }
        out.close();
    }
}
