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

import java.io.*;
import java.util.*;
import static java.lang.Integer.*;
import static java.lang.Math.*;
public class CodeJamC {
	public static void main(String args[]) throws Throwable {
		System.setOut(new PrintStream("C-Large.out"));
		BufferedReader in = new BufferedReader(new FileReader("C-large.in"));
		//BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
		StringBuilder sb = new StringBuilder();
		for (int t=0,T=parseInt(in.readLine().trim());t++<T;) {
			StringTokenizer st=new StringTokenizer(in.readLine());
			int A=parseInt(st.nextToken()),B=parseInt(st.nextToken());
			TreeSet<int[]> set=new TreeSet<int[]>(new Comparator<int[]>() {
				public int compare(int[] o1, int[] o2) {
					return o1[0]!=o2[0]?o1[0]-o2[0]:o1[1]-o2[1];
				}
			});
			for(int i=A;i<=B;i++){
				String a=i+"";
				for(int j=a.length()-1;j>0;j--){
					int b=parseInt(a.substring(j)+a.substring(0,j));
					if(i!=b&&b>=A&&b<=B&&(b+"").length()==a.length()){
						set.add(new int[]{min(i,b),max(i,b)});
					}
				}
			}
			sb.append("Case #"+t+": "+set.size()+"\n");
		}
		System.out.print(new String(sb));
	}
}