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

/**
 *
 * @author amit
 */
import java.io.*;
import java.util.HashSet;
import java.util.Set;
//import java.util.Arrays;
//import java.math.BigInteger;

public class GCJ {

	BufferedReader rin;
	BufferedWriter wout;
	int numCases;

	public String calculate(long A, long B) {
		long count =0;
		for(long i=A;i<B;i++){
			String s = Long.toString(i);
			int Bl = Long.toString(B).length();
			int Al = s.length();
			//System.out.println("\n"+s);
			//System.out.println("\n" + Al + " " + Bl);
			Set<Long> set = new HashSet<Long>();
			for(int k=0;k<=Bl-Al;k++) {

				//System.out.println("\n"+s);

				
				for(int j=0;j<s.length();j++){
					//System.out.println("\nS: " + s);
					s = s.substring(s.length()-1) + s.substring(0, s.length()-1);
					//System.out.println("\nS new: " + s);
					long num = Long.parseLong(s);
					if (num>=A && num<=B && i<num) {
						if(!set.contains(num)) {
							set.add(num);
							//System.out.println("\nCounted: " + i + " " + num);
							count++;
						}
					}

				}
				//System.out.println("\nS newnew: " + s);
				s = "0" + s;
			}
		}
		return Long.toString(count);
	}

	public String getNextInput() {
		try {
			String line = rin.readLine();
			String[] aVars = line.split(" ");
			long A = Long.parseLong(aVars[0]);
			long B = Long.parseLong(aVars[1]);
			return calculate(A,B);

		} catch (IOException e) {
			System.out.println("File Error! Could not read line from file");
		}
		return null;
	}

	public void writeNextOutput(String s) {
		try {
			wout.write(s);
			wout.write("\n");
		} catch (IOException e) {
			System.out.println("Error! Could not write to the file!");
		}
	}

	public GCJ(String s1, String s2) {
		try {
			rin = new BufferedReader(
					new FileReader(s1));
			wout = new BufferedWriter(new FileWriter(s2));
			numCases = Integer.parseInt(rin.readLine());

			for(int i=1; i <= numCases; i++){
				System.out.println("case#" + i);
				String sout = getNextInput();
				sout = "Case #" + Integer.toString(i) + ":" + " " + sout;
				writeNextOutput(sout);
				//System.out.println("case#" + i);
			}
			rin.close();
			wout.close();
		} catch (IOException e) {
			System.out.println("File error");
			System.exit(0);
		}
	}

	public static void main(String[] args) {/*
        if (args.length!=2) {
        System.out.println("Enter input file!");
        System.exit(0);
        }*/
		GCJ a = new GCJ("infile.txt", "out.txt");
	}
}
