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.util.HashSet;
import java.util.Scanner;
import java.util.Set;


public class P3 {
	public static void main(String[] args) { 
		Scanner scan = new Scanner(System.in);
		int t = Integer.parseInt(scan.nextLine()); 
		for (int i = 0; i < t; i++) { 
			String[] x = scan.nextLine().split(" "); 
			int a = Integer.parseInt(x[0]); 
			int b = Integer.parseInt(x[1]);
			
			long count = 0;
			for (int j = a; j <= b; j++) { 
				count += find(j, b);
			}
			System.out.println("Case #" + (i+1) + ": " + count);
		}
		
	}
	
	public static long find(int x, int limit) { 
		long result = 0;
		String s = String.valueOf(x);
		Set<Integer> set  = new HashSet<Integer>();
		for (int i = 1; i < s.length() ; i++) { 
			if (s.charAt(i) != '0') { 
				String first = s.substring(0, i); 
				String second = s.substring(i, s.length());
				
				int number = Integer.parseInt(second + first);
				if (!set.contains(number) && number > x && number <= limit) { 
					result += 1;
					set.add(number);
				}
			}
		}
		return result;
	}
}
