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.BufferedReader;
import java.io.InputStreamReader;

class RN {
    private static BufferedReader br = null;
    private static int numCases;
    private static int lowerBound, upperBound;
    private static String[] input;

    public static void main(String[] args) throws Exception {
        try {
            br = new BufferedReader(new InputStreamReader(System.in));
            numCases = Integer.parseInt(br.readLine().trim());

            for(int i = 0; i < numCases; i++) {
                int numRecycled = 0;
                input = br.readLine().split(" ");
                lowerBound = Integer.parseInt(input[0]);
                upperBound = Integer.parseInt(input[1]);

                for(int j = lowerBound; j < upperBound; j++) {
                    String s = j + "";
                    for(int k = 0; k < s.length()-1; k++) {
                        String temp = s.substring(s.length()-1-k) + s.substring(0, s.length()-k-1);
                        //System.out.println("From " + s + " to " + temp + " with k = " + k);
                        int num = Integer.parseInt(temp);
                        if(num == j) continue;
                        //if(num >= lowerBound && num <= upperBound && !used[num]) {
                        if(num >= lowerBound && num <= upperBound && num > j) {
                            //System.out.println("From " + s + " to " + temp + " with k = " + k);
                            //System.out.println("\t" + j + "\t" + num);
                            numRecycled++;
                            //used[num] = true;
                            //used[j] = true;
                        }
                    }
                }

                System.out.println("Case #" + (i+1) + ": " + numRecycled);
            }
        }
        catch(Exception e) {
            e.getMessage();
            e.printStackTrace();
        }
    }
}
