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

import java.util.ArrayList;
import java.util.Scanner;

/**
 * Created by IntelliJ IDEA.
 * User: danghiskhan
 * Date: 4/14/12
 * Time: 11:44 PM
 */
public class Recycled {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);

        Integer caseCount = 1;

        while (in.hasNextInt()) {
            Integer start = in.nextInt();
            Integer finish = in.nextInt();

            Integer count = 0;

            ArrayList<String> duplicates = new ArrayList<String>();

            for (Integer i = start; i < finish; i++) {
                for (Integer j = i + 1; j <= finish; j++) {

                    String n = i.toString();
                    String m = j.toString();

                    String nPerm;

                    if (n.length() > 1) {
                        for (Integer k = 1; k < n.length(); k++) {
                            nPerm = n.substring(k, n.length()) + n.substring(0, k);

                            Integer nPermInt = Integer.parseInt(nPerm);

                            String dupe = nPerm + ":" + n;

                            if (nPerm.equals(m) && nPermInt > i && !duplicates.contains(dupe)) {
                                //System.out.println("n:" + n + " nPerm: " + nPerm);

                                duplicates.add(dupe);

                                count++;
                            }
                        }
                    }

                }
            }

            System.out.println("Case #" + caseCount++ + ": " + count);
        }

    }
}
