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

public class recycled_numbers {
	public static void main(String[]a) throws Exception{
		
		Scanner f = new Scanner(new File(a[0]));
		int result=0;
		int A,B;
		String n,m;
		HashSet<String> s=new HashSet<String>();
		
		int T=f.nextInt();	//T total case count
		for (int t=1; t<=T;t++){//for each case t
			
			s.clear();
			result=0;				//reset
			A=f.nextInt();B=f.nextInt();	//get values for next case
			
			if (A==B)result=0;//remove case not meeting problem limits 
			else{
				for(int i=A;i<=B;i++){//for each int in range
					n=Integer.toString(i);
					m=new String(n);
					//System.out.println(n);
					for (int j=1;j<n.length();j++){//move each digit to the front & test
						m = m.substring(m.length()-1)+m.substring(0,m.length()-1);
						if(m.matches("^0+[\\d]+")!=true &&
								Integer.parseInt(m)<=B &&
								Integer.parseInt(n)<Integer.parseInt(m)){
							s.add(new String(n+","+m));
							//result++;
							//System.out.println(" matched: "+m);
						}
						
					}
				}
				result = s.size();
			}

			//display output
			System.out.println("Case #" + t + ": " + result);
		}
	}
}
package gcj12;

import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;

public class C {
    void solve() {
        Scanner scan = new Scanner(System.in);
        int tCase = scan.nextInt();
        for (int i = 1; i <= tCase; i++) {
            int res = 0;
            int a = scan.nextInt();
            int b = scan.nextInt();
            for (int j = a; j <= b; j++) {
                int pow = 10;
                Map<Integer, Integer> map = new HashMap<Integer, Integer>();
                while (j / pow > 0) {
                    int tmp = Integer.valueOf((j % pow) + "" + (j / pow));
                    if (tmp > j && tmp <= b && map.get(tmp) == null) {
                        map.put(tmp, tmp);
                        res++;
                    }
                    pow *= 10;
                }
            }
            System.out.println("Case #" + i + ": " + res);
        }

    }

    public static void main(String[] args) {
        new C().solve();
    }
}
