import java.io.*;

class code1
{
	public static void main(String args[]) throws Exception 
	{
		File ii = new File ("C-small-attempt1.in");
		FileInputStream fis = new FileInputStream(ii);
		BufferedReader  br = new BufferedReader(new InputStreamReader (fis));
		int cases = Integer.parseInt(br.readLine());
		FileOutputStream fout = new FileOutputStream ("output.txt");
		DataOutputStream dout = new DataOutputStream (fout);
		int total=0;
		for(int i=0;i<cases;i++){
		String temp = br.readLine();
		String parts [] = temp.split(" ");
		int lower = Integer.parseInt(parts[0]);
		int upper = Integer.parseInt(parts[1]);
		System.out.println(lower+" "+upper);
		
		for(int j=lower;j<=upper;j++)
		{
			int abc = j;int length=0;
			if(j<10)continue;
			while (abc!=0){abc/=10;length++;}
			abc=j;
			for(int m=0;m<length-1;m++){
				int shift = abc%10;
				abc=abc/10;
				System.out.println("hi "+j);
				abc=abc+shift*power(10,length-1);
				if(abc<=upper&&shift!=0&&abc>j)total++;
				System.out.println(total);
			}
		}
 		dout.writeBytes("Case #"+(i+1)+ ": "+total+"\n");
 		total=0;
		}//for close
		
	}

	private static int power(int i, int j) {
		int no=1;
		for(int a=0;a<j;a++){no=10*no;}
		return no;
	}
}
/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package recyclednumbers;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.util.Collection;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Map;
import java.util.Set;

/**
 *
 * @author malte
 */
public class RecycledNumbers {

    static int caseNum = 0;
    static BufferedReader reader;
    static BufferedWriter writer;
    
    public static void main(String[] args) throws FileNotFoundException, IOException {
        
        reader = new BufferedReader(new InputStreamReader(new FileInputStream("./in")));
        
        new File("./out").createNewFile();
        writer = new BufferedWriter(new OutputStreamWriter(new FileOutputStream("./out")));
        
        reader.readLine();  // Skip numberofcases
        String input;
        while ((input = reader.readLine()) != null) {
            input = input.trim();
            String[] numbers = input.split(" ");
            write(getPairCount(numbers[0], numbers[1]));
        }
    }
    
    static int getPairCount(String aStr, String bStr) {
        
        int a = Integer.parseInt(aStr);
        int b = Integer.parseInt(bStr);
        
        if (a < 10 || a == b) {
            return 0;
        }
        
        HashMap<Integer, Set<Integer>> pairs = new HashMap<Integer, Set<Integer>>();
        
        for (int i = a; i <= b; i++) {
            String iStr = Integer.toString(i);
            for (int swaplength = 1; swaplength < iStr.length(); swaplength++) {
                
                int indexToSwap = iStr.length() - swaplength;
                
                if (iStr.charAt(indexToSwap) != '0' && Integer.parseInt("" + iStr.charAt(indexToSwap)) <= Integer.parseInt("" + bStr.charAt(0))) {
                    
                    String newString = iStr.substring(indexToSwap) + iStr.substring(0, indexToSwap);
                    
                    int newInt = Integer.parseInt(newString);
                    if (newInt <= b && newInt > i) {
                        
                        if (pairs.containsKey(newInt)) {
                            
                           if (pairs.get(newInt).contains(i)) {
                               continue;
                           }
                        }
                        
                        Set<Integer> values = pairs.get(i);
                        if (values == null) {
                            
                            values = new HashSet<Integer>();
                            pairs.put(i, values);
                        }
                        
                        values.add(newInt);
                        
                        /*boolean alreadyFound = false;
                        for (int[] pair: pairs) {
                            
                            if ((pair[0] == newInt || pair[1] == newInt) && (pair[0] == i || pair[1] == i)) {
                                
                                alreadyFound = true;
                                break;
                            }
                        }
                        
                        if (!alreadyFound) {
                            pairs.add(new int[]{i, newInt});
                            count++;
                        }*/
                    }
                }
            }
        }
        
        return countEntries(pairs);
    }
    
    public static int countEntries(Map<Integer, Set<Integer>> map) {
        
        int count = 0;
        for (Set set: map.values()) {
            
            count += set.size();
        }
        
        return count;
    }
    
    public static void write(Object out) throws IOException {
        
        caseNum += 1;
        writer.write(String.format("Case #%s: %s%n", caseNum, out));
        writer.flush();
    }
}
