/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package recyclednumbers;

import java.util.HashSet;

/**
 *
 * @author vandit
 */
public class RecycleNumbers {

    private HashSet<String> numbers = new HashSet<String>();
    private HashSet<String> initialTempNumbers = new HashSet<String>();
    private HashSet<String> finalTempNumbers = new HashSet<String>();

    HashSet<Pair> numberPairs = new HashSet<Pair>();


    private void findRecycledNumbers(int start, int end, int places) {


        for (int i = start; i <= end; i++) {
            String initialNumber = Integer.toString(i);
            //if (!(numbers.contains(initialNumber) || finalTempNumbers.contains(initialNumber))) {

                StringBuffer tempNumber = new StringBuffer(initialNumber);
                int len = tempNumber.length();
                int startIndexToMove = len - places;
                String tempString = tempNumber.substring(startIndexToMove);
                if ((places == 1 && tempString.equals("0")) || tempString.charAt(0) == '0') {
                    continue;
                }
                tempNumber.delete(startIndexToMove, len);
                String finalTempNumber = tempString + tempNumber.toString();

                if (! (finalTempNumber.equals(initialNumber) || Integer.parseInt(finalTempNumber) > end || Integer.parseInt(finalTempNumber) < Integer.parseInt(initialNumber))) {
                    numbers.add(initialNumber);
                    finalTempNumbers.add(finalTempNumber);
                    Pair pair = new Pair(finalTempNumber,initialNumber);
                    numberPairs.add(pair);
                }
            }

        

    }

    public HashSet<Pair> findAllRecycledNumbers(int start, int end) {
        int length = Integer.toString(start).length();
        for (int i = 1; i < length; i++) {
            findRecycledNumbers(start, end, i);
        }
        return numberPairs;
    }
}

import java.io.FileNotFoundException;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.Arrays;


public class RecycledNumbers {

	public static void main(String [] args) throws NumberFormatException, IOException {
		java.io.BufferedReader r = new java.io.BufferedReader(
				new java.io.FileReader(
						"C:\\Users\\AhmedMTM\\Desktop\\C-small-attempt0.in"));
		int no = Integer.parseInt(r.readLine());
		int[] results = new int[no];
		Arrays.fill(results, 0);
		for (int t = 0; t < no; t++) {
			String[] input = r.readLine().split(" ");

			int A = Integer.parseInt(input[0]);
			int B = Integer.parseInt(input[1]);
			
			for(int j=B; j>A; j--) {
				for(int k=A; k<j; k++) {
					String one = ""+k;
					String two = ""+j;
					if(one.length() == two.length()) {
						for(int l=0; l<one.length(); l++) {
							if(one.equals(two)) {
								//System.out.println(one);
								results[t]++;
							}
							one = one.substring(one.length()-1, one.length())+one.substring(0, one.length()-1);
						}
					}
				}
			}
			
			try {
				FileWriter outFile = new FileWriter(
						"C:\\Users\\AhmedMTM\\Desktop\\output.txt");
				PrintWriter out = new PrintWriter(outFile);
				for (int i = 0; i < results.length; i++) {
					out.println("Case #"+(i+1)+": "+results[i]);
				}

				out.close();
			} catch (IOException e) {
				e.printStackTrace();
			}

		
		}
	}
}
