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

			}
		}

	}
}

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package google.code.jam.recycled.numbers;

import java.util.ArrayList;
import java.util.HashMap;

/**
 *
 * @author Lucas
 */
public class RecycledNumbers {

    public ArrayList<Integer> findRecycledNumbers(ArrayList<Integer[]> list) {

        ArrayList<Integer> result = new ArrayList<Integer>();
        Integer[] current;
        int x;
        int y;
        int total;
        int temp;
        String str;

        for (int n = 0; n < list.size(); n++) {

            current = list.get(n);
            total = 0;

            x = current[0];
            y = current[1];

            for (int m = x; m <= y; m++) {

                str = String.valueOf(m);

                for (int j = 0; j < str.length() - 1; j++) {

                    str = str.substring(1) + str.charAt(0);
                    temp = Integer.parseInt(str);

                    if ((temp <= y) && (temp > m) && (temp >= x)) { 
                        total++;
                    }
                }
            }
            result.add(total);
        }
        return result;
    }
}
