import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;
import java.util.Set;

public class CopyOfCopyOfMain {

	static int ndigits(int n) {
		return (int) (Math.log10(n) + 1);
	}

	static int rot(int n, int dig) {
		return (int) ((n % 10) * Math.pow(10, dig - 1)) + (int) (n / 10);
	}

	public static void main(String[] args) throws FileNotFoundException {
		String file = "C-large";
		Scanner in = new Scanner(new File(file + ".in"));
		PrintWriter out = new PrintWriter(new File(file + ".out"));

		int T = in.nextInt();
		for (int t = 1; t <= T; t++) {
			int A = in.nextInt();
			int B = in.nextInt();

			int c = 0;
			int[] list = new int[ndigits(B)];
			numbers: for (int i = A; i <= B; i++) {
				int digs = ndigits(i);
				int rot = i;
				int pairs = 0;

				Arrays.fill(list, -1);
				list[0] = i;

				digits: for (int j = 1; j <= digs + 1; j++) {

					rot = rot(rot, digs);
					if(rot < i)
						continue;

					if (A <= rot && rot <= B) {
						for (int k = 0; k < j; k++) {
							if (list[k] == rot) {
								continue digits;
							}
						}
						pairs++;
						list[j] = rot;
					}
				}

				//c += pairs * (pairs + 1) / 2;
				c += pairs ;
				// c+=digs;
			}
			out.println("Case #" + t + ": " + c);
		}

		in.close();
		out.close();
	}
}

package problemc;

import java.io.BufferedReader;
import java.io.FileReader;

import java.util.ArrayList;
import java.util.List;

public class ProblemC {
    
    public static void main(String args[]){
        List<String> inputs = readInput();
        String n;
        String m;
        int count = 0;
        for(String input : inputs ){
            count++;
            n = input.split(" ")[0];
            m = input.split(" ")[1];
            
            output(count, findRecycledNumbers(n,m));            
        }
    }
    
    
    private static int findRecycledNumbers(String n, String m){
        int recycledNumbers = 0;
        n = n.trim();
        m = m.trim();
        int mFirst = Integer.parseInt(m.substring(0,1));
        int nLong = Integer.parseInt(n);
        int mLong = Integer.parseInt(m);
        String nString = "";
                
        for(int i = nLong; i<mLong; i++){
            nString = ""+i;
            nLong = Integer.parseInt(nString);
            //System.out.println("INTERESTING");
            //System.out.println("I: " + i);
            for(int j=nString.length() - 1; j>0; j--){
               // System.out.println("nSTRING: " + nString);
              String valueAt = nString.substring(j, j+1);
                //System.out.println("VALUE AT: " + valueAt);
                if(Integer.parseInt(valueAt) <= mFirst){
                    //System.out.println("IN HERE");
                    String end = nString.substring(j);
                  String remaining = nString.substring(0, j);
                  String finalNum = end + remaining;
                  
                  
                  if(Integer.parseInt(finalNum) <= mLong && Integer.parseInt(finalNum) > nLong){                      
                    recycledNumbers++;
                  }
                }
            }
        }
        
        
        return recycledNumbers;
    }
  private static List<String> readInput(){
    List<String> untranslatedStrings = new ArrayList<String>();
    try{
        BufferedReader in = new BufferedReader(new FileReader("input.txt"));
        Long numTestCases = Long.parseLong(in.readLine());
        for(int i=0; i<numTestCases.intValue(); i++){
            untranslatedStrings.add(in.readLine());
        }          
    }catch(Exception e){
      e.printStackTrace();
    }
    
    return untranslatedStrings;
  }
  
  private static void output(int input, int recycledNum){
    System.out.println("Case #"+input+": "+recycledNum);
  }
}
