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);
	}
}

package codejam;

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

//out.println("Case #"+(tt++)+": "+line.trim());
public class Plantilla2 {
    
    public static class pair implements Comparable<pair> {
        
        int a;
        int b;
        
        pair(int a, int b) {
            this.a = a;
            this.b = b;
        }
        
        @Override
        public int compareTo(pair o) {
            if (this.a == o.a && this.b == o.b) {
                return 0;
            }
            
            return this.toString().compareTo(o.toString());
        }
        
        public String toString() {
            return this.a + " " + this.b;
        }
    }
    
    public static String girar(String str) {
        return str.charAt(str.length() - 1) + str.substring(0, str.length() - 1);
        
    }
    
    public static void main(String args[]) throws Exception {
        BufferedReader br = new BufferedReader(new FileReader(new File("in.in")));
        PrintWriter out = new PrintWriter(new File("out.out"));
        
        

//        System.out.println(girar("5600070"));
        int N = Integer.parseInt(br.readLine());
        for (int i = 1; i <= N; i++) {
            
            String ss[] = br.readLine().split("[ ]+");
            int A = Integer.parseInt(ss[0]);
            int B = Integer.parseInt(ss[1]);
            TreeSet<pair> ts = new TreeSet<pair>();
            String yy;
            for (int j = A; j < B; j++) {
                String xx = "" + j;                
                for (int k = 0; k < String.valueOf(j).length(); k++) {
                    yy = girar(xx);
                    if (A <= j && j < Integer.parseInt(yy) && Integer.parseInt(yy) <= B) {
                        ts.add(new pair(j, Integer.parseInt(yy)));
                    }
                    xx = yy;
                }
                
            }
            
            
            
            out.println("Case #" + i + ": " + ts.size());
            
            
            
        }
        
        out.close();
        br.close();
        System.exit(0);
    }
}
