package codejam;

import java.util.*;
import java.io.*;

public class RecycledNumbers {
	public static void main(String[] args) throws IOException {
		BufferedReader in = new BufferedReader(new FileReader("in.txt"));
		PrintWriter out = new PrintWriter(new File("out.txt"));
		
		int T = Integer.parseInt(in.readLine());
		for (int t = 1; t <= T; ++t) {
			String[] parts = in.readLine().split("[ ]+");
			int A = Integer.parseInt(parts[0]);
			int B = Integer.parseInt(parts[1]);
			
			int cnt = 0;
			for (int i = A; i < B; ++i) {
				String str = String.valueOf(i);
				int n = str.length();
				String res = "";
				Set<Integer> seen = new HashSet<Integer>();
				for (int j = n - 1; j > 0; --j) {
					res = str.substring(j) + str.substring(0, j);
					int k = Integer.parseInt(res);
					if (k > i && k <= B) {
						//System.out.println("(" + i + ", " + k + ")");
						if (!seen.contains(k)) {
							++cnt;
							seen.add(k);
						}
					}
				}
			}

			out.println("Case #" + t + ": " + cnt);
		}
		
		in.close();
		out.close();
		System.exit(0);
	}
}

import java.io.*;
import java.util.*;
import java.math.*;
/** @author Samuel Ahn */

public class C {
    public static void main(String args[]) throws Exception {
	Scanner in = new Scanner(System.in);
	int T = in.nextInt();
	for (int i = 1; i <= T; i++) {
	    int A = in.nextInt();
	    int B = in.nextInt();
		int sum = 0;

	    for (int n = A; n < B; n++) {
		String x = Integer.toString(n);
		ArrayList<Integer> list = new ArrayList<Integer>();
		for (int j = 1; j < x.length(); j++) {
		    String a = x.substring(0, j);
		    String b = x.substring(j);
		    int tmp = Integer.parseInt(b + a);
		    if ((tmp > n) && (tmp <= B) && (!list.contains(tmp))) {
			sum++;
			list.add(tmp);
			//break;
		    }
		}
	    

	    }
	    System.out.printf("Case #%d: %d\n", i, sum);
	}
    }
 
}