/*
 * 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 com.google.codejam;

import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;

public class DancingWithGooglers {

	private int limit(long min, long max){
		if (min>max)
			return 0;
		int count = 0;
		for (long i = min; i <= max; i++) {
			int loopCount = 1;
			long start = i;
			long rotation = i;
			do {
				rotation = rotate(start,loopCount);
				if ( rotation <= max && rotation > start) {
//					System.out.println("pair numbers : " + start + "," + rotation);
					count+=1;
				}
//				else{
//					System.out.println("!!not pair numbers : " + start + "," + rotation);
//				}
				loopCount++;

			} while (loopCount<=Long.toString(start).length());
		}
		return count;
	}

//	private long rotate(long x){
//		if (x<9) {
//			return x;
//		}
//		long firstpart = x/10;
//		long secondpart = x%10;
//		double firstpartlen = (String.valueOf(firstpart)).length();
//		int mul = (int) Math.pow(10, firstpartlen);
//		long fin = (secondpart * mul) + firstpart;
//		return fin;
//	}
	private long rotate(long x,int index){
		if (x<9) {
			return x;
		}
		String s = Long.toString(x);
		String s1 = s.substring(0, s.length()-index);
		String s2 = s.substring(s.length()-index, s.length());
		String s3 = s2+s1;
		return Long.parseLong(s3);
	}
	public static void main(String[] args) throws IOException{
		BufferedReader in = new BufferedReader(new FileReader("resources/googlecodejam/dancingwiththegooglers.txt"));
		String strLine;
		int caseLine  = 0;
		int lineCount = 0;
		DancingWithGooglers dancingWithGooglers = new DancingWithGooglers();
		while ((strLine = in.readLine()) != null) {
			// Print the content on the console
			if (lineCount == 0) {
				lineCount+=1;
				continue;
			}
			caseLine += 1;
			long min = Long.parseLong(strLine.split(" ")[0]);
			long max = Long.parseLong(strLine.split(" ")[1]);
			System.out.println("Case #" + caseLine + ": " + dancingWithGooglers.limit(min,max));
		}

	}
}
