/*
 * 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");
    }

}
import java.util.*;

class Recycle{
  public static void main(String[] args){
    Scanner sc = new Scanner(System.in);
    int testcase, A, B;
    testcase = sc.nextInt();
    for(int i=1;i<=testcase;i++){
      A = sc.nextInt();
      B = sc.nextInt();
      System.out.println("Case #"+i+": "+countpair(A,B));
    }
  }
  
  public static int countpair(int A, int B){
    int numdigit, temp = A, temp2, counter;
    int[] remember;
    counter = 0;
    while(A<=B){
      remember = new int[7];
     numdigit = (int)Math.log10((double)A) + 1;
     temp = A;
     for(int i=0;i<numdigit;i++){
       temp2 = temp%10;
       temp/=10;
       temp+=temp2*(int)Math.pow(10,numdigit-1);

       if(check(temp, A, B, remember)){
         counter++;
       }
     }
     A++;
    }
    return counter;
  }
  
  public static boolean check(int checker, int A, int B, int[] remember){
    boolean checked = false;
    boolean alreadyhave = false;
    int i = 0;
      if(checker> A && checker<=B){
        for(i=0;i<remember.length;i++){
          if(remember[i] == checker){
            alreadyhave = true;
            break;
          }
        }
        if(!alreadyhave){
          i=0;
          while(remember[i]!=0)
            i++;
          remember[i] = checker;
          checked = true;
        } 
      }
    return checked;

  }
}
  