package qual;

import java.util.Scanner;

public class RecycledNumbers {

	public static void main(String[] args) {
		new RecycledNumbers().run();

	}

	private void run() {
		Scanner sc = new Scanner(System.in);
		int T = sc.nextInt();
		for (int t = 0; t < T; t++) {
			int A = sc.nextInt();
			int B = sc.nextInt();
			int result = solve(A, B);
			System.out.printf("Case #%d: %d\n", t + 1, result);
		}
	}

	public int solve(int A, int B) {
		int result = 0;
		for (int i = A; i <= B; i++) {
			int dig = (int) Math.log10(A/*same as B*/) + 1;
			int aa = i;
			for (int d = 0; d < dig - 1; d++) {
				aa = (aa % 10) * (int)Math.pow(10, dig - 1) + (aa / 10);
				if (i == aa) {
					break;
				}
				if (i < aa && aa <= B) {
//					System.out.printf("(%d, %d) ", i, aa);
					result++;
				}
			}
		}
		return result;
	}

}

package qualC;

import java.util.*;

public class RecycledNumbers {
  
  private static int cases;
  
  public static void main(String[] args) {
    Scanner input = new Scanner(System.in);
    if (input.hasNextInt()) {
      cases = input.nextInt();
    }
    
    for (int i = 0; i < cases; i++) {
      System.out.println("Case #" + (i+1) + ": " + findRecycled(input));
    }
  }
  
  public static int findRecycled(Scanner input) {
    int startingPoint = 0;
    int endingPoint = 0;
    int counter = 0;
    
    if (input.hasNextInt()) {
      startingPoint = input.nextInt();
    }
    
    if (input.hasNextInt()) {
      endingPoint = input.nextInt();
    }
    
   
    //for each item from start->end..
    for (Integer i = startingPoint; i < endingPoint; i++) {
      
      //cast that item to a string..
      String value = i.toString();
      ArrayList<Integer> thisItem = new ArrayList<Integer>();
      //for each character in the string..
      for (int z = 0; z < value.length(); z++) {
        
        //shuffle the characters along one
        String rotate = value.substring(z);
        rotate += value.substring(0, z);
        
        //cast to an int
        int shuffledInt = Integer.parseInt(rotate);
        
        //make sure it is within the boundaries..
        if (shuffledInt <= endingPoint && shuffledInt >= startingPoint) {
          
          //if it is greater than the original then it is a duplicate
          if (Integer.parseInt(value) < shuffledInt) {
            //make sure if we've looked at this item before that it's not a duplicate..
            if (!thisItem.contains(shuffledInt)) {
              counter++;
              thisItem.add(shuffledInt);
            }
          }
        }
       
      }
    }
    
    return counter;
  }
}