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

import java.io.File;
import java.io.FileWriter;
import java.util.ArrayList;
import java.util.Scanner;

/**
 *
 * @author daniele
 */
public class GCJ_C {
    
    public static void main(String[] args) throws Exception{
        
        
        
        Scanner in = new Scanner(new File(args[0]));
        FileWriter out = new FileWriter("/home/daniele/Scrivania/Output");
        

        int prove=in.nextInt();
        int min,max;
        int cifre;
        int cifreaus;
        String temp;
        int aus;
        int count=0;
        ArrayList<Integer> vals = new ArrayList<Integer>();
        int jcount=0;
        ArrayList<Integer> perm = new ArrayList<Integer>();
        
        out.write("");
        out.flush();
        
        for(int i=1;i<=prove;i++){
            
            out.append("Case #" +i+": ");out.flush();
            
            min=in.nextInt();
            max=in.nextInt();
            
            for(int j=min;j<=max;j++){
               if(!vals.contains(j)){
                    temp=""+j;
                    cifre=temp.length();
                    aus=j;
                    perm.add(j);
                    for(int k=1;k<cifre;k++){
                        aus=rotateOnce(aus);
                        temp=""+aus;
                        cifreaus=temp.length();//elusione zeri iniziali
                        if(aus>=min && aus<=max && aus!=j && cifreaus==cifre && nobody(vals,perm)){ 
                            perm.add(aus);
                            jcount ++;
                            
                        }
                        
                    }
                    while(jcount>0){count+=jcount; jcount--;}
                    vals.addAll(perm);
                    perm= new ArrayList<Integer>();
                    
                }
            }
            out.append(count+"\n");out.flush();
            count=0;
            vals= new ArrayList<Integer>();
        }
        
        
        
    }
        static public int rotateOnce(int n){
            String s=""+n;
            if(s.length()>1){
                s=s.charAt(s.length()-1) + s.substring(0,s.length()-1);
                n=Integer.parseInt(s);
            }
            return n;
        }    
        
        static public boolean nobody(ArrayList<Integer> v,ArrayList<Integer> a){;
            for(int i=0;i<a.size();i++)
                if(v.contains(a.get(i))) return false;
            return true;
        } 
    
}


import java.io.*;

public class GoogleCodeInP3 {
  
  public static void main(String[] args) throws IOException {
    BufferedReader mbr = new BufferedReader(new FileReader(args[0]));
    int a = -1;
    try {
      a = Integer.parseInt(mbr.readLine());
    }
    catch (Exception e) { }
    FileWriter fw = new FileWriter("outputFile2a");
    BufferedWriter bfw = new BufferedWriter(fw);
    for (int i = 0; i < a; i++) {
      String thisLine = mbr.readLine();
      String[] w = thisLine.split(" ");
      String N = w[0];
      String M = w[1];
      bfw.write("Case #" + (i + 1) + ": " + recycleNumbers(N, M));
      if (i < a - 1) { bfw.write("\n"); }
    }
    bfw.close();
  }

  
  
  public static int recycleNumbers(String a, String b) {
    int a1 = Integer.parseInt(a);
    int b1 = Integer.parseInt(b);
    int howMany = 0;
    int w = 0;
    return howManyFor(a1, b1);
  }
  
  public static int howManyFor(int a, int b) {
    int thisMany = 0;
    int y = b + 1;
    while (y >= a) {
      y = y - 1;
      int w = 0;
      while (a + w < y) {
        if (!checkSameDigits(a + w, y)) { w = w + 1; continue; }
        String currentA = "" + (a + w);
        String currentB = "" + y;
        thisMany = thisMany + checkIfMatch(currentA, currentB);
        w = w + 1;
      }
    }
    return thisMany;
  }
  
  public static boolean checkSameDigits(int a, int b) {
    String s = "" + a;
    String t = "" + b;
    if (s.length() != t.length()) { return false; }
    int[] whereFound = new int[s.length()];
    for (int i = 0; i < s.length(); i++) {
      if (s.indexOf(t.charAt(i)) == -1) { return false; }
      if (whereFound[s.indexOf(t.charAt(i))] == 0) {
        whereFound[s.indexOf(t.charAt(i))] = 1;
        continue;
      }
      int x = s.indexOf(t.charAt(i));
      for (int j = x; j < whereFound.length; j++) {
        if (whereFound[j] == 1) { x = j; }
      }
      if (s.indexOf(t.charAt(x)) == -1) { return false; }
      whereFound[s.indexOf(t.charAt(x))] = 1;
    }
    return true;
  }
  
  public static int checkIfMatch(String currentA, String currentB) {
    String a = currentA;
    String b = currentB;
    int andThisMany = 0;
    for (int w = 0; w < a.length(); w++) {
      if (w == 0) { if (a.equals(b)) { andThisMany = andThisMany + 1; continue; } }
      if ((a.substring(w) + a.substring(0, w)).equals(currentB)) { andThisMany = andThisMany + 1; }
    }
    return andThisMany;
  }

}