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.*;
public class ProblemC {
    public static void main(String... args) {
        Scanner sc = new Scanner(System.in);
        int T = sc.nextInt();
        for (int t=1; t<=T; t++) {
            int A = sc.nextInt();
            int B = sc.nextInt();
            int digit = String.valueOf(A).length();
            Set<String> set = new HashSet<>();
            for ( int i=digit-1; i>0; i-- )  {
                for (int n=A; n<=B; n++) {
                    String ns = String.valueOf(n);
                    String ms = (ns.substring(digit-i) + ns.substring(0,digit-i));
                    int m = Integer.parseInt(ms);
                    if( m>B ) continue;
                    if( n<m ) set.add(ns+","+ms);
                }
            }
            System.out.println("Case #" +t+ ": " + set.size());
        }
    }
}
