import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.HashSet;

public class Recycled {
    public static void main(String[] args) {
        try {
            BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
            int t = Integer.parseInt(br.readLine());
            for (int i = 0; i < t; i++) {
                String[] str = br.readLine().split(" ");
                int a = Integer.parseInt(str[0]);
                int b = Integer.parseInt(str[1]);
                System.out.println("Case #" + (i + 1) + ": " + find(a, b));
            }
        } catch (IOException e) {
            e.printStackTrace();
        }
    }

    private static int find(int a, int b) {
        HashSet<Long> used = new HashSet<Long>();
        int digits = String.valueOf(a).length();
        if (digits == 1) return 0;
        for (int i = a; i <= b; i++) {
            int s = 10;
            int m = (int) Math.pow(10, digits-1);
            for (int j = 0; j < digits-1; j++) {
                int r = i % s;
                if (r < s/10) continue;
                int q = i / s;
                int rn = r * m + q;
                s *= 10; m /= 10;
                if (i != rn && rn >= a && rn <= b) {
                    long pp;
                    if (rn < i) pp = (long)rn << 30 | i;
                    else pp = (long)i << 30 | rn;
                    if (!used.contains(pp)) {
                        used.add(pp);
                    }
                }
            }
        }
        return used.size();
    }
}

package gcj.gcj2012.qualif;

import gcj.SolverBase;

import java.io.BufferedReader;
import java.io.PrintStream;
import java.util.HashSet;
import java.util.Set;

public class ProblemC extends SolverBase {

    public ProblemC() {
        super("Recycled Numbers");
    }

    public static void main(String[] args) throws Exception {
        SolverBase problem = new ProblemC();
        // problem.verbose = true;
        problem.solve(System.in, System.out);
    }

    @Override
    public void solveSingle(BufferedReader reader, PrintStream out) throws Exception {
        int[] AB = readSingleLineIntArray(reader);
        int A = AB[0];
        int B = AB[1];

        // How many digits?
        int d = (""+A).length();
        check(d == (""+B).length());

        int x = 0;
        Set<String> done = new HashSet<String>();

        // Naive implementation 1 : full loop
        for(int i=A;i<B;i++){
            for(int k=1;k<d;k++){
                int j = rotate(i,d,k);
                if( i<j && j<=B ){
                    String pair = i+","+j;
                    if( !done.contains(pair) ){
                        x ++;
                        done.add(pair);
                    }
                }
            }
        }

        out.println(x);
    }

    static int[] pows = { 1, 10, 100, 1000, 10000, 100000, 1000000, 10000000 };

    private int rotate(int i, int d, int k) {
        int pow1 = pows[k];
        int pow2 = pows[d-k];
        int bar = i/pow1;
        int foo = pow2 * (i%pow1);
        int j = foo + bar;
        //System.out.println("rotate("+i+","+k+")"+" = "+j);
        return j;
    }
}
