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


public class Main {
	public static void main(String[] args) {
		Scanner r = new Scanner(System.in);
		
		int T = r.nextInt();
		int caseNumber = 1;
		while(T-- > 0){
			int A = r.nextInt();
			int B = r.nextInt();
			
			int ret = 0;
			for(int x = A; x <= B; x++){
				HashSet<Integer> S = new HashSet<Integer>();
				
				int curr = x;
				int L = (curr + "").length();
				int L10 = 1;
				for(int i = 0; i < L - 1; i++)
					L10 *= 10;
				
				for(int itr = 0; itr < L; itr++){
					if((curr + "").length() == L && !S.contains(curr) && curr <= B && curr >= A && curr < x){
						ret++;
					}
					
					S.add(curr);
					curr = R(curr, L10);
				}
			}
			
			System.out.printf("Case #%d: %d\n", caseNumber++, ret);
		}
	}
	static int R(int x, int L){
		int m = x % 10; 
		return (x / 10) + (L * m);
	}
}
