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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.HashSet;
import java.util.Set;


public class Recycled {

	
	public static boolean isRecycled(int a, int b) {
		String left = a+"";
		String right = b+"";
		return (left+left).contains(right);
		//		if(left.length()!=right.length()) return false;
//		int l = left.length();
//		for(int i=0;i<l;i++) {
//			boolean o = true;
//			for(int j=0;j<l;j++) {
//				if(left.charAt((i+j)%l) == right.charAt(j)) continue;
//				else o=false;
//			}
//			if(o) return true;
//		}
//		return false;
	}
	
	public static Set<Integer> recycles(int in) {
		String s = in+"";
		int l = s.length();
		Set<Integer> out = new HashSet<Integer>();
		for(int i=1;i<l;i++) {
			String n = "";
			for(int j=0;j<l;j++) n += s.charAt((i+j)%l);
			out.add(Integer.parseInt(n));
		}
		return out;
	}
	
	public static void main(String[] args) throws NumberFormatException, IOException {
		BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
		
		int cases = Integer.parseInt(in.readLine());
		for (int i = 1; i <= cases; i++) {
			String[]e = in.readLine().trim().split(" ");
			int A = Integer.parseInt(e[0]);
			int B = Integer.parseInt(e[1]);
			
			int count = 0;
			
			for(int x=A;x<B;x++) {
				for(int y:recycles(x)) {
					if(x<y && y<=B) count ++;
				}
			}
			
			System.out.println("Case #"+i+": "+count);
		}
	}
	
}
