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

package Happy;
import java.io.*;
import java.math.*;
import java.lang.*;
import java.util.*;
import java.util.Arrays.*;
import java.io.BufferedReader;
//import java.io.IOException;
//import java.io.InputStreamReader;
//import java.io.PrintWriter;
//import java.util.StringTokenizer;

/**
 *
 * @author ipoqi
 */
public class Happy {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
        new Happy().haha();
    }

    public void haha() {
        BufferedReader in = null;
        BufferedWriter out = null;
        try{
            in = new BufferedReader(new FileReader("C-large.in"));
            out = new BufferedWriter(new FileWriter("LLL.out"));
            int T = Integer.parseInt(in.readLine());
            System.out.println("T="+T);

            //LinkedList<Integer> mm = new LinkedList<Integer>();
            //mm.add(new LinkedList<Integer>());
           //int[][] mm;
           //for(int ii=0;ii<mm.length;ii++){
           //     mm[0][ii] = 1;
           //}


            for(int i=0;i<T;i++){
                String[] line = in.readLine().split(" ");
                int A = Integer.parseInt(line[0]);
                int B = Integer.parseInt(line[1]);
                //System.out.print(" A = "+A+"\n");
                //System.out.print(" B = "+B+"\n");

                int ans = 0;

                
                for(int j=A;j<B;j++){
                    int n=j;
                    if(n>=10){
                        String N = Integer.toString(n);
                        int nlen = N.length();
                        List<Integer> oks = new ArrayList<Integer>();
                        for(int k=0;k<nlen-1;k++){
                            String M = "";
                            for(int kk=1;kk<=nlen;kk++){
                                 M = M + N.charAt((k+kk)%nlen);
                            }
                            int m = Integer.parseInt(M);
                            //System.out.print(" N = "+N+"\n");
                            //System.out.print(" M = "+M+"\n");

                            if(m>n && m<=B) {
                                boolean isNewOne = true;
                                for(int kkk=0;kkk<oks.size();kkk++){
                                    //System.out.print(" KKK = "+oks.get(kkk)+"\n");
                                    if(m==oks.get(kkk)){
                                        isNewOne = false;
                                    }
                                }
                                if(isNewOne){
                                    //System.out.print(" N = "+N+"\n");
                                    //System.out.print(" M = "+M+"\n");
                                    oks.add(m);
                                    ans++;
                                }
                            }
                        }
                    }
                }
                out.write("Case #"+(i+1)+": "+ans+"\n");
                System.out.print("Case #"+(i+1)+": "+ans+"\n");
            }
            in.close();
            out.close();
        }catch(Exception e){
            e.printStackTrace();
            try{
                in.close();
                out.close();
            }catch(Exception e1){
                e1.printStackTrace();
            }
        }
        System.out.print("YES!\n");
    }

}
/**
 * 
 */
package org.codejam.rn;

import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.HashMap;
import java.util.Map;


/**
 * 
 * @author juanjo
 */
public class RecycledNumbersMain {
  
  public static String newline = System.getProperty("line.separator");
  
  
  private static void generateNumbers(Map<String, String> pairs, int A, int B, int n) {
    int m;
    String s = String.valueOf(n);
    String pair = null;
    int length = s.length() - 1;
    int[] data = new int[length];
    
    for (int i = 0; i < length; i++) {
      //s = s.charAt(length) + s.substring(0, length);   
      s = new StringBuilder().append(s.charAt(length)).append(s.substring(0, length)).toString();
      data[i] = Integer.parseInt(s);
      m = Integer.parseInt(s);
      
      if ((A <= n) && (n < m) && (m<=B)) {
        pair = new StringBuilder().append(n).append("-").append(m).toString();
        if (!pairs.containsKey(pair));
          pairs.put(pair, pair);
      }
    }   
  }
  
  private static int getRecyledPairsCount(int A, int B) {
    Map<String, String> pairs = new HashMap<String, String>();    
    for (int n = A; n <= B; n++) {
      generateNumbers(pairs, A, B, n);
    }
    return pairs.size();
  }

	/**
	 * @param args
	 */
	public static void main2(String[] args) {
	  long time = System.currentTimeMillis();
	  System.out.println("getRecyledPairsCount: " + getRecyledPairsCount(100,500));
	  System.out.println("Execution time ms.: " + (System.currentTimeMillis() - time) );
	}
	
	public static void main(String[] args) {
	  long time = System.currentTimeMillis();
    if (args.length != 2) {
      System.out.println("Usage: java " + RecycledNumbersMain.class  + " inputFile outputFile");
      System.exit(0);
    }

    int count = 0;
    BufferedReader in = null;
    FileWriter out = null;
    String line = null;
    int testCasesTotal = 0;
    int testCasesCount = 0;
    String result;
    
    int A, B;
    String s[];

    try {
      in = new BufferedReader(new FileReader(args[0]));
      out = new FileWriter(args[1]);
      
      while ( (line = in.readLine()) != null) {
        count++;
        if (count == 1) {
          testCasesTotal = Integer.valueOf(line);
          System.out.println("In file number of test cases: " + testCasesTotal + ".");
        } //if
        else {
          s = line.split(" ");
          A = Integer.parseInt(s[0]);
          B = Integer.parseInt(s[1]);    
          
          result = String.valueOf(getRecyledPairsCount(A, B));
          testCasesCount++;
          result = "Case #" + testCasesCount + ": " + result;
          System.out.println(result + " -- Line: " + testCasesCount + ": " + line);
          out.write(result + newline);
        }
      }
      if (out != null) {
        out.close();
      }
    } //try
    catch (Exception e) {
      e.printStackTrace();
    }
    finally {
      System.out.println("Execution time ms.: " + (System.currentTimeMillis() - time) );
    }
  } // Main

}
