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.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.HashSet;

public class reycle {

    public static void main(String[] args) throws Exception {

        BufferedReader in = new BufferedReader(new FileReader("C-small-attempt0.in"));
        PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter("C-small-attempt0.out")));
        boolean state[] = new boolean[1001];
        HashSet<Integer> mem=new HashSet<Integer>();
        int t = Integer.parseInt(in.readLine());
 
        for (int q = 1; q <= t; q++) {
            String[] st = in.readLine().split(" ");
            int A = Integer.parseInt(st[0]);
            int B = Integer.parseInt(st[1]);
            int count = 0;
            for (int i = A; i <= B; i++) {
                state[i] = true;
                String temp = i + "";
                for (int j = 1; j < temp.length(); j++) {
                    String r = temp.substring(j) + temp.substring(0, j);
                    int b = Integer.parseInt(r);
                    if ((b + "").length() == temp.length() && b >= A && b <= B && !state[b]&&!mem.contains(b)) {
                      mem.add(b);
                        count++;
                    }
                }

            mem.clear();
            }
            out.write("Case #"+q+": "+count+"\n");
            Arrays.fill(state, false);
        }
        out.close();

    }
}
