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

import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.util.Scanner;

/**
 *
 * @author amahdy
 */
public class GCJ_QR_C {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) throws FileNotFoundException, IOException {
        new GCJ_QR_C().start();
    }
    
    private void start() throws FileNotFoundException, IOException {

        Scanner in = new Scanner(
                new FileReader("/home/amahdy/c-small.in"));
        int x = in.nextInt();
        in.nextLine();
        
        for (int i = 0; i < x; ) {
            
            int A = in.nextInt();
            int B = in.nextInt();
            int val = 0;
            for(int j=A; j<B; j++) {
                
                char[] zz = (j + "").toCharArray();
                int m = zz.length-1;
                for(int k=0; k<m; k++) {
                    char t = zz[m];
                    for(int n=m; n>0;) {
                        zz[n]=zz[--n];
                    }
                    zz[0] = t;
                    if(t=='0') {
                        continue;
                    }else {
                        int f = Integer.parseInt(String.valueOf(zz));
                        if(f > j && f <= B) {
                            val++;
                        }
                    }
                }
            }
            System.out.println("Case #" + ++i + ": " + val);
        }
    }
}
