import java.io.*;

class code1
{
	public static void main(String args[]) throws Exception 
	{
		File ii = new File ("C-small-attempt1.in");
		FileInputStream fis = new FileInputStream(ii);
		BufferedReader  br = new BufferedReader(new InputStreamReader (fis));
		int cases = Integer.parseInt(br.readLine());
		FileOutputStream fout = new FileOutputStream ("output.txt");
		DataOutputStream dout = new DataOutputStream (fout);
		int total=0;
		for(int i=0;i<cases;i++){
		String temp = br.readLine();
		String parts [] = temp.split(" ");
		int lower = Integer.parseInt(parts[0]);
		int upper = Integer.parseInt(parts[1]);
		System.out.println(lower+" "+upper);
		
		for(int j=lower;j<=upper;j++)
		{
			int abc = j;int length=0;
			if(j<10)continue;
			while (abc!=0){abc/=10;length++;}
			abc=j;
			for(int m=0;m<length-1;m++){
				int shift = abc%10;
				abc=abc/10;
				System.out.println("hi "+j);
				abc=abc+shift*power(10,length-1);
				if(abc<=upper&&shift!=0&&abc>j)total++;
				System.out.println(total);
			}
		}
 		dout.writeBytes("Case #"+(i+1)+ ": "+total+"\n");
 		total=0;
		}//for close
		
	}

	private static int power(int i, int j) {
		int no=1;
		for(int a=0;a<j;a++){no=10*no;}
		return no;
	}
}

package gcj;
 
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileWriter;
import java.util.HashMap;
import java.util.Scanner;

/**
 *
 * @author Mervin.Lavin
 */
public class Gcj
{

    public static void main
        (String[] args)
        throws Exception
    {
        doProb3( "C-small-attempt1.in", "output.txt" );
    }
    
    private static void doProb3
        ( String inputFileName, String outputFileName )
        throws Exception
    {
        File inputFile = new File( inputFileName );
        Scanner scanner = null;
        scanner = new Scanner( inputFile );
        File outputFile = new File( outputFileName );
        BufferedWriter output = new BufferedWriter( new FileWriter( outputFile ) );
        
        int a, b, otherPairs;
        HashMap<Integer,Integer> distinctPairs;
        int testCases = scanner.nextInt();
        for ( int caseNum = 1; caseNum <= testCases; caseNum++ )
        {
          a = scanner.nextInt();
          b = scanner.nextInt();
          distinctPairs = new HashMap<Integer,Integer>();
          otherPairs = 0;
          for ( int n = a; n < b; n++ )
          {
              String stringN = Integer.toString(n);
              if ( stringN.length() == 1 )
              {
                  continue;
              }
              for ( int index = 1; index < stringN.length(); index++ )
              {
                  String stringM = 
                      stringN.substring( index, stringN.length() ) 
                      + stringN.substring( 0, index );
                  int m = Integer.parseInt( stringM );
                  if ( ( !stringN.equals( stringM ) )
                      && ( n < m ) && ( m <= b ) )
                  {
                      if ( distinctPairs.containsKey( n ) && !distinctPairs.containsValue( m ) )
                      {
                          otherPairs++;
                      }
                      else 
                      {
                          distinctPairs.put( n, m );
                      }
                  }
              }
          }
          output.append( "Case #" + caseNum + ": " +  ( distinctPairs.size() + otherPairs ) );
          output.newLine();
        }
        scanner.close();
        output.close();
    }
}
