/*
 * 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 mgg.utils;

import java.util.ArrayList;
import java.util.Collections;
import java.util.HashSet;

public class CorrespondenceUtils {

	public static String getT9Correspondence(char c) {

		/** Generating code:
		for(int i = 0; i<=25; i++){
			System.out.println("case '"+((char)(i+((int)'a')))+"':");
			System.out.println("return \"\";");
		}
		 */
		switch (c){
		case 'a':	return "2";
		case 'b':	return "22";
		case 'c':	return "222";

		case 'd':	return "3";
		case 'e':	return "33";
		case 'f':	return "333";

		case 'g':	return "4";
		case 'h':	return "44";
		case 'i':	return "444";

		case 'j':	return "5";
		case 'k':	return "55";
		case 'l':	return "555";

		case 'm':	return "6";
		case 'n':	return "66";
		case 'o':	return "666";

		case 'p':	return "7";
		case 'q':	return "77";
		case 'r':	return "777";
		case 's':	return "7777";

		case 't':	return "8";
		case 'u':	return "88";
		case 'v':	return "888";

		case 'w':	return "9";
		case 'x':	return "99";
		case 'y':	return "999";
		case 'z':	return "9999";

		case ' ':	return "0";

		default:
			throw new RuntimeException("Not valid character: '" + c + "'");
		}
	}

	public static char getGooglereseCorrespondence(char c) {

		/** Generating code:
		String strG = "ejp mysljylc kd kxveddknmc re jsicpdrysi rbcpc ypc rtcsra dkh wyfrepkym veddknkmkrkcd de kr kd eoya kw aej tysr re ujdr lkgc jv";
		String strE = "our language is impossible to understand there are twenty six factorial possibilities so it is okay if you want to just give up";
		
		HashSet<String> set = new HashSet<String>();
		
		for (int i = 0; i< strE.length(); i++){
			
			set.add("case '" + strG.charAt(i) + "':\treturn '" + strE.charAt(i) + "';");
			//System.out.println("case '" + strG.charAt(i) + "':\treturn '" + strE.charAt(i) + "';");
		}
				
		ArrayList<String> list = new ArrayList<String>(set);
		
		Collections.sort(list);
		
		for(String s : list){
			System.out.println(s);
		}
		 **/
		switch (c){
		case 'a':	return 'y';
		case 'b':	return 'h';
		case 'c':	return 'e';
		case 'd':	return 's';
		case 'e':	return 'o';
		case 'f':	return 'c';
		case 'g':	return 'v';
		case 'h':	return 'x';
		case 'i':	return 'd';
		case 'j':	return 'u';
		case 'k':	return 'i';
		case 'l':	return 'g';
		case 'm':	return 'l';
		case 'n':	return 'b';
		case 'o':	return 'k';
		case 'p':	return 'r';
		case 'q':	return 'z';
		case 'r':	return 't';
		case 's':	return 'n';
		case 't':	return 'w';
		case 'u':	return 'j';
		case 'v':	return 'p';
		case 'w':	return 'f';
		case 'x':	return 'm';
		case 'y':	return 'a';
		case 'z':	return 'q';
		case ' ':	return ' ';

		default:
			throw new RuntimeException("Not valid character: '" + c + "'");
		}
	}

}
