package fixjava;

public class StringUtils {

	/** Repeat the given string the requested number of times. */
	public static String repeat(String str, int numTimes) {
		StringBuilder buf = new StringBuilder(Math.max(0, str.length() * numTimes));
		for (int i = 0; i < numTimes; i++)
			buf.append(str);
		return buf.toString();
	}

	/**
	 * Pad the left hand side of a field with the given character. Always adds at least one pad character. If the length of str is
	 * greater than numPlaces-1, then the output string will be longer than numPlaces.
	 */
	public static String padLeft(String str, char padChar, int numPlaces) {
		int bufSize = Math.max(numPlaces, str.length() + 1);
		StringBuilder buf = new StringBuilder(Math.max(numPlaces, str.length() + 1));
		buf.append(padChar);
		for (int i = 1, mi = bufSize - str.length(); i < mi; i++)
			buf.append(padChar);
		buf.append(str);
		return buf.toString();
	}

	/**
	 * Pad the right hand side of a field with the given character. Always adds at least one pad character. If the length of str is
	 * greater than numPlaces-1, then the output string will be longer than numPlaces.
	 */
	public static String padRight(String str, char padChar, int numPlaces) {
		int bufSize = Math.max(numPlaces, str.length() + 1);
		StringBuilder buf = new StringBuilder(Math.max(numPlaces, str.length() + 1));
		buf.append(str);
		buf.append(padChar);
		while (buf.length() < bufSize)
			buf.append(padChar);
		return buf.toString();
	}

	/** Intern all strings in an array, skipping null elements. */
	public static String[] intern(String[] arr) {
		for (int i = 0; i < arr.length; i++)
			arr[i] = arr[i].intern();
		return arr;
	}

	/** Intern a string, ignoring null */
	public static String intern(String str) {
		return str == null ? null : str.intern();
	}

}

import java.util.*;
import java.io.*;
class Recycled_Numbers
{
  public static void main(String arg [])
  {
    int check =-456;
       String m="";
    int counter =0;
    int calculate =0;
    String sub="";
    int mi =0;
     int ma=0;
    String path;
    String first,second;
    int numberOfLoops=0;
     Scanner read = new Scanner(System.in);
    System.out.println("pls enter your file");
    path = read.nextLine();
    
   
    BufferedWriter bw;
    try
    {
      File  fobj = new File(path);
      Scanner sc = new Scanner(fobj);
      bw =new BufferedWriter( new FileWriter("RecycleOutput.txt"));
      int tests = sc.nextInt()  ,meter = 1;
      while (meter <= tests)
      {  
     
        mi= sc.nextInt();
          ma =sc.nextInt();
     
    while(mi<=ma)
    {
         counter =0;  
        m = mi+"";
     
     
      while(counter <m.length()-1)
      {
        numberOfLoops=m.length()-1;
        second = m.substring(numberOfLoops -counter);
        first = m.substring(0,numberOfLoops-counter);
        sub = second+first;
     
        if ((Integer .parseInt(sub)>mi)&&(Integer .parseInt(sub)<=ma)&&(Integer .parseInt(sub)!=check) )
        {
            
          calculate++;
        check= Integer .parseInt(sub);
        }
        
        counter++;
      }
      
      
      mi++;
    } 
    bw.write("Case #"+meter+": " +calculate );
    bw.newLine();
    calculate =0;
    meter++;
    } 
    bw.close();
      }//end of try
    catch(IOException e)
    {
      System.out.println(e);
    }
   
    }    
}