import java.util.*;
import java.lang.*;
import java.math.*;
import java.io.*;

import static java.lang.Math.*;
import static java.util.Arrays.*;
import static java.util.Collections.*;

public class C{
	Scanner sc=new Scanner(System.in);

	int INF=1<<28;
	double EPS=1e-9;

	int caze, T;
	int A, B;

	void run(){
		T=sc.nextInt();
		for(caze=1; caze<=T; caze++){
			A=sc.nextInt();
			B=sc.nextInt();
			solve();
		}
	}

	void solve(){
		int ans=0;
		for(int n=A; n<=B; n++){
			int digit=(int)(log10(n)+EPS);
			int d=(int)pow(10, digit);
			// debug("n", n);
			for(int m=rot(n, d); m!=n; m=rot(m, d)){
				// debug("m", m);
				if(n<m&&m<=B){
					ans++;
				}
			}
		}
		answer(ans+"");
	}

	int rot(int n, int d){
		return n/10+n%10*d;
	}

	void answer(String s){
		println("Case #"+caze+": "+s);
	}

	void println(String s){
		System.out.println(s);
	}

	void print(String s){
		System.out.print(s);
	}

	void debug(Object... os){
		System.err.println(deepToString(os));
	}

	public static void main(String[] args){
		try{
			System.setIn(new FileInputStream("dat/C-small.in"));
			System.setOut(new PrintStream(new FileOutputStream("dat/C-small.out")));
		}catch(Exception e){}
		new C().run();
		System.out.flush();
		System.out.close();
	}
}

package be.tim.recycled;

/**
 *
 * @author Tim Boeckstaens
 * @version 1.0
 */
public class Recycler {
    public String process(String line) {
        String[] split = line.split(" ");

        if(split.length != 2){
            throw new IllegalArgumentException("Foute regel");
        }

        int a = Integer.parseInt(split[0]);
        int b = Integer.parseInt(split[1]);

        int counter = 0;

        for(int i = a ; i < b; i++){

            for(int j = i + 1; j <= b; j++){
                String s = i + "";
                String t = j + "";
                char[] chars = s.toCharArray();

                for(int x = 1; x < chars.length; x++){
                    char[] result = new char[chars.length];
                    int index = 0;
                    int start = chars.length - x;
                    for(int copy = start; copy < chars.length; copy++){
                        result[index++] = chars[copy];
                    }
                    for(int end = 0; end < start; end++){
                        result[index++] = chars[end];
                    }
                    if(new String(result).equals(t)){
                        counter++;
                        break;
                    }
                }

            }

        }

        return counter + "";
    }
}

