/*
 * Problem C. Recycled Numbers
 * 
 * Do you ever become frustrated with television because you keep seeing the
 * same things, recycled over and over again? Well I personally don't care about
 * television, but I do sometimes feel that way about numbers.
 * 
 * Let's say a pair of distinct positive integers (n, m) is recycled if you can
 * obtain m by moving some digits from the back of n to the front without
 * changing their order. For example, (12345, 34512) is a recycled pair since
 * you can obtain 34512 by moving 345 from the end of 12345 to the front. Note
 * that n and m must have the same number of digits in order to be a recycled
 * pair. Neither n nor m can have leading zeros.
 * 
 * Given integers A and B with the same number of digits and no leading zeros,
 * how many distinct recycled pairs (n, m) are there with A â¤ n < m â¤ B?
 * 
 * Input
 * 
 * The first line of the input gives the number of test cases, T. T test cases
 * follow. Each test case consists of a single line containing the integers A
 * and B.
 * 
 * Output
 * 
 * For each test case, output one line containing "Case #x: y", where x is the
 * case number (starting from 1), and y is the number of recycled pairs (n, m)
 * with A â¤ n < m â¤ B.
 * 
 * Limits
 * 
 * 1 â¤ T â¤ 50.
 * 
 * A and B have the same number of digits.

Small dataset

1 â¤ A â¤ B â¤ 1000.

Large dataset

1 â¤ A â¤ B â¤ 2000000.

Sample


Input 
 	
Output 
 
4
1 9
10 40
100 500
1111 2222
Case #1: 0
Case #2: 3
Case #3: 156
Case #4: 287
 */

package google.codejam.y2012.qualifications;

import google.codejam.commons.Utils;

import java.io.IOException;
import java.util.StringTokenizer;

/**
 * @author Marco Lackovic <marco.lackovic@gmail.com>
 * @version 1.0, Apr 14, 2012
 */
public class RecycledNumbers {

	private static final String INPUT_FILE_NAME = "C-large.in";
	private static final String OUTPUT_FILE_NAME = "C-large.out";

	public static void main(String[] args) throws IOException {
		String[] input = Utils.readFromFile(INPUT_FILE_NAME);
		String[] output = new String[input.length];
		int x = 0;
		for (String line : input) {
			StringTokenizer st = new StringTokenizer(line);
			int a = Integer.valueOf(st.nextToken());
			int b = Integer.valueOf(st.nextToken());
			System.out.println("Computing case #" + (x + 1));
			output[x++] = "Case #" + x + ": " + recycledNumbers(a, b);
		}
		Utils.writeToFile(output, OUTPUT_FILE_NAME);
	}

	private static int recycledNumbers(int a, int b) {
		int count = 0;
		for (int n = a; n < b; n++) {
			count += getNumGreaterRotations(n, b);
		}
		return count;
	}

	private static int getNumGreaterRotations(int n, int b) {
		int count = 0;
		char[] chars = Integer.toString(n).toCharArray();
		for (int i = 0; i < chars.length; i++) {
			chars = rotateRight(chars);
			if (chars[0] != '0') {
				int m = Integer.valueOf(new String(chars));
				if (n == m) {
					break;
				} else if (n < m && m <= b) {
					count++;
				}
			}
		}
		return count;
	}

	private static char[] rotateRight(char[] chars) {
		char last = chars[chars.length - 1];
		for (int i = chars.length - 2; i >= 0; i--) {
			chars[i + 1] = chars[i];
		}
		chars[0] = last;
		return chars;
	}

}


import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.*;

public class testrun {

	
	public static void main(String[] args) {
		
		
	    
	    BufferedReader in;
	    String line;
	    PrintWriter out;
	   
	    // Inputting File.
		try {
			in = new BufferedReader(new FileReader("C:\\Users\\imumair\\Desktop\\C-large.in"));
			
			
			int i = Integer.parseInt( in.readLine() );
			ArrayList<String> outputlist = new ArrayList<String>();

			
			String outstring = "";
			
			String initstring = "" ;
			
		    int count = 1 ; 
		    
		    int resultcount = 0;
			
			while(in.ready() && count <= i){
				
				initstring = "Case #" + count+": " ;
				
				try {
					line = in.readLine();
					
					
					outstring = "";
					
					String[] linearray =   line.split(" ");
					
					resultcount = 0;
					int a = Integer.parseInt( linearray[0]);
					
					int b = Integer.parseInt( linearray[1]); 
					
				
					for (int j = a ; j<b ; j++){
					
						ArrayList<Integer>  digitlist = new ArrayList<Integer>();
						
						
						int number = j; // = and int
						
						
						LinkedList<Integer> stack = new LinkedList<Integer>();
						while (number > 0) {
						    stack.push( number % 10 );
						    number = number / 10;
						}
	
						while (!stack.isEmpty()) {
						  digitlist.add(stack.pop());
						}
						
						int numdigits = digitlist.size();
						
						
						
						
						if(numdigits > 1  ){
							
							
    							String comb = "";
							
								 
    							
    							if(allequal(digitlist)){
    							   
    							   resultcount = resultcount + 0;
    							} else {
    							
    							    String prevcomb = "";
    							    
    							    //going throguh all combinations
	    							for (int m = 1 ; m <numdigits; m++) {
										
										comb = "";
										
										for(int m1 = m; m1<numdigits; m1++){
											comb = comb+digitlist.get(m1);
										}
										
										for(int m2 = 0; m2< m ; m2++ ){
											comb = comb + digitlist.get(m2);
										}
									    
										int resultant = Integer.parseInt(comb); 
										
								
									
										
										if( resultant <= b && resultant > j && !prevcomb.equals(comb) ){
											resultcount++;
											prevcomb = comb;
											//System.out.println("( " +j+" , " + comb +" )"  );
										}
										
									
									
									}
								
    							}							

						}
						
						
						
					
					}
					
					
					outstring = initstring+outstring +resultcount;
					
					
					outputlist.add(outstring);
					
					//System.out.println(line);
					
							
				} catch (IOException e) {
					// TODO Auto-generated catch block
					e.printStackTrace();
					System.out.println("readline fails!!");
				}
				
				count++;
				
			}
				
			in.close();
			
			
			//Outputting File.
			
            out = new PrintWriter(new FileWriter("C:\\Users\\imumair\\Desktop\\A-small-output.out"));
			if(i >0){
				int k;
				for (k = 0; k < i ; k++){
					out.println(outputlist.get(k));
				}
			}else{
				out.println("");
			}
				
				
			out.close();			
			
			
		}  catch (Exception e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
			System.out.println("Ready Input fails.");
		}
		
	
		
	}
	
	
	public static boolean allequal(ArrayList<Integer> digitlist){
		
		int n = digitlist.size();
		
		int start = digitlist.get(0);  
		
		boolean all = true;
		
			for (int i = 0; i<n ; i++ ){
				
				if(start !=  digitlist.get(i)){
					all = false;
                    break;					
				}
				
				
			}
		
		return all;
	}
	
	

}
