import java.util.HashSet;
import java.util.Scanner;

public class C {

	static HashSet p = new HashSet();
	static int low;
	static int high;
	int count = 0;

	public static void main(String[] args) {

		Scanner sc = new Scanner(System.in);
		int no = sc.nextInt();

		for (int i = 1; i <= no; i++) {

			p.clear();
			low = sc.nextInt();
			high = sc.nextInt();

			for (int l = low; l <= high; l++) {
				recycle(l);
			}
			System.out.println("Case #" + i + ": " + p.size());

		}
	}

	public static void recycle(int no) {

		String s = Integer.toString(no);
		for (int i = 0; i < s.length(); i++) {
			String rec = s.substring(i) + s.substring(0, i);
			int r = Integer.parseInt(rec);
			if (r != no && r >= low && r <= high) {
				int min = Math.min(r, no);
				int max = Math.max(r, no);
				String a = Integer.toString(min) + "" + Integer.toString(max);
				p.add(a);

			}
		}

	}
}

import java.util.*;

/**
 *
 * @author Izhari Ishak Aksa
 */
public class ProblemC {

    static int ret = 0;
    
    static void check(String a, int A) {
        int x = Integer.parseInt(a);
        HashMap<Integer, Integer> map = new HashMap<Integer, Integer>();
        for (int i = 1; i < a.length(); i++) {
            String c = a.substring(i) + a.substring(0, i);
            int y = Integer.parseInt(c);
            if (y >= A && y < x && !map.containsKey(y)) {
                ret++;
                map.put(y, 1);
            }
        }
    }
    
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int T = Integer.parseInt(sc.nextLine());
        for (int t = 1; t <= T; t++) {
            int a = sc.nextInt();
            int b = sc.nextInt();
            ret = 0;
            for (int i = a + 1; i <= b; i++) {
                check(i + "", a);
            }
            System.out.println("Case #" + t + ": " + ret);
        }
    }
    
}
