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.BufferedWriter;
import java.io.File;
import java.io.FileWriter;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Scanner;


public class RecylcedNumbers {

	public static void main(String[] args) throws Exception {
		Scanner in = new Scanner(new File("input.in"));
		BufferedWriter bfrw = new BufferedWriter(new FileWriter("output.out"));
		
		long N = in.nextLong();
		String output = "";
		for(long i = 0; i < N;i++){
			long A = in.nextLong();
			long B = in.nextLong();
			
			output += "Case #"+(i+1)+": " + solve(A,B) + "\n";
		}
		
		bfrw.write(output);
		in.close();
		bfrw.close();
	}
	
	private static long solve(long A,long B){
		long ans = 0;
		if(B <= 9) return 0;
		HashSet<String> set = new HashSet<String>();
		for(long i = A; i <=B; i++){
			String s = i+"";
			
			for(int j = 0; j < s.length();j++){
				String one = s.substring(s.length()-j);
				String two = s.substring(0,s.length()-j);
	
				if(Integer.parseInt(one+two) <= B && i < Integer.parseInt(one+two)) {
					ans++;
					//System.out.println(s + " --> " + one + two);
					set.add(i+","+Integer.parseInt(one+two));
				}
			}
		}
		
		return set.size();
	}
}
