/*
 * 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 CodeJam2012;

import java.util.HashMap;
import java.util.HashSet;
import java.util.Scanner;

public class RecycledNumbers {

	public static void main(String[] args){
		Scanner reader = new Scanner(System.in);
		int cases = reader.nextInt();
		reader.nextLine();

		for(int i = 1; i <= cases; i++){
			String _case = reader.nextLine();
			int pos = 0;
			int pos2 = 0;

			while(_case.charAt(pos2) != ' ')
				pos2++;
			int a = Integer.parseInt(_case.substring(pos, pos2));
			pos = pos2 + 1;
			pos2 = pos;

			while(pos2 < _case.length() && _case.charAt(pos2) != ' ')
				pos2++;
			int b = Integer.parseInt(_case.substring(pos, pos2));

			String result = "" + recycleCount3(a, b);

			System.out.println("Case #" + i + ": " + result);
		}
	}

	public static int recycleCount(int a, int b){
		int count = 0;
		HashSet<Integer> nums = new HashSet<Integer>();

		for(int i = a; i <= b; i++){
			String num = i + "";
			
			if(!nums.contains(i)){
				nums.add(i);
				if(num.length() > 1){
					String test_s = num;
					for(int j = 0; j < num.length(); j++){
						test_s = test_s.charAt(test_s.length() - 1) + test_s.substring(0, test_s.length() - 1);
						int int_s = Integer.parseInt(test_s);
						
						if(int_s >= a && int_s <= b && !nums.contains(int_s)){
							nums.add(i);
							nums.add(int_s);
							count++;
						}
					}
				}
			}
		}

		return count;
	}

	public static int recycleCount2(int a, int b){
		int count = 0;
		HashSet<Integer> nums = new HashSet<Integer>();

		for(int i = a; i <= b; i++){

			String test_s = i + "";
			int length = test_s.length();
			HashSet<Integer> temp = new HashSet<Integer>();
			
			for(int j = 0; j < length; j++){
				test_s = test_s.charAt(test_s.length() - 1) + test_s.substring(0, test_s.length() - 1);
				int int_s = Integer.parseInt(test_s);
				temp.add(int_s);
			}
			
			for(Integer in : temp){
				if(!nums.contains(in) && in.intValue() != i){
					nums.add(in);
					count++;
				}
			}
			
			nums.addAll(temp);
		}

		return count;
	}
	
	public static int recycleCount3(int a, int b){
		HashSet<HashSet<Integer>> nums = new HashSet<HashSet<Integer>>();

		for(int i = a; i <= b; i++){

			String test_s = i + "";
			int length = test_s.length();
			HashSet<Integer> temp = new HashSet<Integer>();
			
			for(int j = 0; j < length; j++){
				test_s = test_s.charAt(test_s.length() - 1) + test_s.substring(0, test_s.length() - 1);
				int int_s = Integer.parseInt(test_s);
				temp.add(int_s);
			}
			
			for(Integer in : temp){
				HashSet<Integer> tempSet = new HashSet<Integer>();
				tempSet.add(in);
				tempSet.add(i);
				if(in >= a && in <= b && in.intValue() != i && (!nums.contains(tempSet))){
					nums.add(tempSet);
				}
			}
			
		}

		return nums.size();
	}
}
