/*
 * 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.BufferedReader;
import java.io.BufferedWriter;
import java.io.DataInputStream;
import java.io.DataOutputStream;
import java.io.FileInputStream;
import java.io.FileOutputStream;
import java.io.FileWriter;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.util.ArrayList;


public class gcjq3 {

	public static void main(String[] args) {
	       
		try{
			FileInputStream ifstream = new FileInputStream("files/C-small-attempt0.in");
			DataInputStream in = new DataInputStream(ifstream);
			BufferedReader br = new BufferedReader(new InputStreamReader(in));
			
			FileOutputStream ofstream = new FileOutputStream("files/output");
			DataOutputStream out = new DataOutputStream(ofstream);
			BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(out));
			
			int numCases = Integer.parseInt(br.readLine());
			
			for(int i=0; i<numCases; i++){
				bw.write("Case #" + Integer.toString(i+1) + ": " + compute(br.readLine()) + "\n");
				bw.flush();
			}
			
			in.close();
			out.close();
			
		}catch (Exception e){
			System.err.println("Error: " + e.getMessage());
			e.printStackTrace();
		}
	}           
    
    public static String compute(String in){
   	
        int c = 0;
    	
    	String[] parms = in.split(" ");
        
        int ns = Integer.parseInt(parms[0]);
        int ne = Integer.parseInt(parms[1]);
        
        
        while(ns <= ne){
        	String num = Integer.toString(ns);
        	for(int i=1; i<num.length(); i++){
        		if(num.substring(i).charAt(0) != '0'){
        			String rnum = num.substring(i) + num.substring(0, i);
        			
        			if(Integer.parseInt(rnum) <= ne && Integer.parseInt(num) < Integer.parseInt(rnum)){
        				c++;
        			}
        		}
        	}
        		
        	ns++;
        }
               
        return Integer.toString(c);
    }
}

