/*
 * 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 org.code.jam;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.util.ArrayList;
import java.util.StringTokenizer;

public class RecycledNumbers 
{
	public static void main(String[] args) 
	{
		try 
		{
			BufferedReader in = new BufferedReader(new InputStreamReader(new FileInputStream("D:\\academics\\CodeJamWS\\C-small-attempt0.in")));
			BufferedWriter out = new BufferedWriter(new OutputStreamWriter(new FileOutputStream("D:\\academics\\CodeJamWS\\small-output.txt")));
			
			String lineInput = in.readLine();
			int counter = 1;
			Integer a,b;
			
			while( (lineInput = in.readLine()) != null)
			{
//				System.out.println(lineInput);
//				System.out.println(decodeInput(lineInput));
//				out.write("Case #" + counter + ": " + decodeInput(lineInput));
				StringTokenizer tok = new StringTokenizer(lineInput," ");
				a = Integer.valueOf(tok.nextToken());
				b = Integer.valueOf(tok.nextToken());
//				System.out.println(distinctRecyclables(a, b));
//				distinctRecyclables(a, b);
				out.write("Case #" + counter + ": " + distinctRecyclables(a, b));
//				System.out.println(Integer.MAX_VALUE);
				out.newLine();
				counter++;
			}
			
			in.close();
			out.close();
			
		} catch (FileNotFoundException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}
	}
	
	public static int distinctRecyclables(Integer a,Integer b)
	{
		int cnt = 0;;
		String comboString;
		ArrayList<String> recyclablesCombo = new ArrayList<String>();
		
		if(String.valueOf(a).length() == 1)
			return 0;
		
		for(int i = a; i < b ; i++)
		{
			comboString =  String.valueOf(i);
			for(int j = String.valueOf(i).length() - 1; j > 0 ; j--)
			{
				int origint = Integer.valueOf(comboString);
				int quotient = Integer.valueOf(comboString) / 10;
				int remainder = Integer.valueOf(comboString) % 10;
				
				comboString =  "" + remainder + quotient;
				int permutedint = Integer.valueOf(comboString); 
				if(remainder != 0 && permutedint <= b && permutedint >= a &&  permutedint != i && permutedint != origint && !(recyclablesCombo.contains(permutedint + "," + i) || recyclablesCombo.contains(i + "," + permutedint)))
				{
					if(i < permutedint)
						recyclablesCombo.add(i + "," + permutedint);
					else
						recyclablesCombo.add(i + "," + origint);
					
					if(origint == i)
						cnt++;
				}
			}
		}
		
		System.out.println(recyclablesCombo.size());
		/*for(int i = 0; i < recyclablesCombo.size(); i++)
			System.out.println(recyclablesCombo.get(i));*/
		
		
		
		return recyclablesCombo.size();
	}
}
