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 codejam;

import java.io.*;
import java.util.ArrayList;
import java.util.HashSet;
import java.util.List;

/**
 *
 * @author Ronak
 */
public class C {    
    public static void main(String[] args) throws FileNotFoundException, IOException {
        
        File f = new File("C-large.in");
        FileInputStream fstream = new FileInputStream(f);
        DataInputStream in = new DataInputStream(fstream);
        BufferedReader br = new BufferedReader(new InputStreamReader(in));
        String strLine = "";
        int count = 0, T = 0;
        List<String> left = new ArrayList<String>();
        while ((strLine = br.readLine()) != null) {
            if (count == 0) {
                T = Integer.parseInt(strLine.trim());
            } else {
                strLine.trim();
                String[] l = strLine.split(" ");
                int min = Integer.parseInt(l[0]);
                int max = Integer.parseInt(l[1]);                
                System.out.print("Case #" + count + ": ");
                for (int n = min; n <= max; n++) {
                    String str = String.valueOf(n);
                    for (int i = 1; i < str.length(); i++) {
                        String temp = str.substring(i, str.length()) + str.substring(0, i);
                        if (temp.charAt(0) != '0') {
                            int m = Integer.parseInt(temp);
                            if (n < m && m <= max && n >= min) {
                                left.add(n + "" + m + "");
                            }
                        }
                    }
                }
                System.out.println(new ArrayList<String>(new HashSet<String>(left)).size());
                left.clear();
            }
            count++;
        }
    }
}
