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.*;
public class RecycledNumbers {
    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        int t = Integer.parseInt(br.readLine());
        for(int z=0; z<t; z++) {
            StringTokenizer st = new StringTokenizer(br.readLine()," ");
            int n = Integer.parseInt(st.nextToken());
            int m = Integer.parseInt(st.nextToken());
            long ans  =0;
            for(int i=n; i<=m; i++) {
                ans+=(no(i,m));
            }
            
            System.out.println("Case #"+(z+1)+": "+ans);
        }   
    }
    public static int no(long n, long max) {
        String s = n+"";
        int p = s.length();
        HashSet<Integer> b = new HashSet<Integer>();
        //int ans = 0;
        for(int i=1; i<p; i++) {
            if(s.charAt(i)!='0') {
                String s1 = s.substring(i) + s.substring(0,i);
                int temp = Integer.parseInt(s1);
                if(temp>n && temp<=max && !b.contains(temp)) {
                    //System.out.println(n+" "+temp);
                    //ans++;
                    b.add(temp);
                }
            }
        }
        return b.size();
    }
}
