/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package gcj;

import java.io.File;
import java.io.FileWriter;
import java.util.ArrayList;
import java.util.Scanner;

/**
 *
 * @author daniele
 */
public class GCJ_C {
    
    public static void main(String[] args) throws Exception{
        
        
        
        Scanner in = new Scanner(new File(args[0]));
        FileWriter out = new FileWriter("/home/daniele/Scrivania/Output");
        

        int prove=in.nextInt();
        int min,max;
        int cifre;
        int cifreaus;
        String temp;
        int aus;
        int count=0;
        ArrayList<Integer> vals = new ArrayList<Integer>();
        int jcount=0;
        ArrayList<Integer> perm = new ArrayList<Integer>();
        
        out.write("");
        out.flush();
        
        for(int i=1;i<=prove;i++){
            
            out.append("Case #" +i+": ");out.flush();
            
            min=in.nextInt();
            max=in.nextInt();
            
            for(int j=min;j<=max;j++){
               if(!vals.contains(j)){
                    temp=""+j;
                    cifre=temp.length();
                    aus=j;
                    perm.add(j);
                    for(int k=1;k<cifre;k++){
                        aus=rotateOnce(aus);
                        temp=""+aus;
                        cifreaus=temp.length();//elusione zeri iniziali
                        if(aus>=min && aus<=max && aus!=j && cifreaus==cifre && nobody(vals,perm)){ 
                            perm.add(aus);
                            jcount ++;
                            
                        }
                        
                    }
                    while(jcount>0){count+=jcount; jcount--;}
                    vals.addAll(perm);
                    perm= new ArrayList<Integer>();
                    
                }
            }
            out.append(count+"\n");out.flush();
            count=0;
            vals= new ArrayList<Integer>();
        }
        
        
        
    }
        static public int rotateOnce(int n){
            String s=""+n;
            if(s.length()>1){
                s=s.charAt(s.length()-1) + s.substring(0,s.length()-1);
                n=Integer.parseInt(s);
            }
            return n;
        }    
        
        static public boolean nobody(ArrayList<Integer> v,ArrayList<Integer> a){;
            for(int i=0;i<a.size();i++)
                if(v.contains(a.get(i))) return false;
            return true;
        } 
    
}


package round1;

import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collection;
import java.util.HashMap;
import java.util.Iterator;
import java.util.List;

public class ProblemC {

	public static void main(String[] args) {
		int a = 1555555;
		int b = 2266666;
		BufferedReader in = null;
		try {
			in = new BufferedReader(new FileReader(args[0]));
			int lineNumber = 0;
			String line = null;
			while ((line = in.readLine()) != null) {
				if (lineNumber > 0) {
					String[] split = line.split(" ");
					a = Integer.parseInt(split[0]);
					b = Integer.parseInt(split[1]);
					System.out.println("Case #" + lineNumber + ": "
							+ getRecycledCount(a, b));
				}
				lineNumber++;
			}
		} catch (IOException ex) {
			ex.printStackTrace();
		} finally {
			try {
				if (in != null)
					in.close();
			} catch (IOException ex) {
				ex.printStackTrace();
			}
		}

	}

	private static int getRecycledCount(int a, int b) {
		HashMap<String, List<String>> map = new HashMap<String, List<String>>();
		for (int i = a; i <= b; i++) {
			String string = Integer.toString(i);
			char[] charArray = string.toCharArray();
			Arrays.sort(charArray);
			String key = new String(charArray);
			List<String> list = map.get(key);

			if (list == null) {
				list = new ArrayList<String>();
			}
			list.add(string);
			map.put(key, list);
		}
		Collection<List<String>> values = map.values();
		int count = 0;
		for (List<String> list : values) {
			if (list.size() > 1) {
				count = count + getRotations(list);
			}
		}
		return count;
	}

	private static int getRotations(List<String> list) {
		int count = 0;
		while (list.size() > 1) {
			String str1 = list.remove(0);
			for (String str2 : list) {
				String str3 = str2 + str2;
				if (str3.contains(str1)) {
					// list.remove(str2);
					// System.out.println(str1 + " " + str2);
					count++;
					// break;
				}

			}
		}
		return count;
	}
}
