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

package recycled;

import java.io.BufferedReader;
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.FileWriter;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.TreeSet;

/**
 *
 * @author Alfred
 */
public class Main {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
    try {
            FileInputStream fstream = new FileInputStream("C-small-attempt0.in");
            DataInputStream in = new DataInputStream(fstream);
            BufferedReader br = new BufferedReader(new InputStreamReader(in));
            FileWriter outFile = new FileWriter("out.txt");
            PrintWriter out = new PrintWriter(outFile);
            String line;
            line = br.readLine();
            int cases = Integer.parseInt(line);
            for (int i=1; i<=cases;i++){
                line = br.readLine();
                String[] values = line.split(" ");
                int A = Integer.parseInt(values[0]);
                int B = Integer.parseInt(values[1]);
                int total=0;
                for (int n=A; n<=B;n++){
                    TreeSet<String> solutions = new TreeSet<String>();
                    for (int k=1;k<values[1].length();k++){
                        String m = circshift(n,k);
                        int mVal = Integer.parseInt(m);
                        if(mVal<=B && mVal!=n  && mVal> n && !m.startsWith("0") && m.length()==Integer.toString(n).length() )
                        {
                            solutions.add(m);
                        }                   
                    }
                    total+=solutions.size();
                }
                out.println("Case #"+i+": "+total);
            }
            in.close();
            out.close();
        } catch (Exception e) {//Catch exception if any
            System.err.println("Error: " + e.getMessage());
        }

}

    private static String circshift(int n, int k) {
        String nString=Integer.toString(n);
        int len=nString.length();
        String m =  nString.substring(len-k)+nString.subSequence(0, len-k);
        //System.out.println(n+" "+m);
        return m;
    }

}

import java.util.*;

public class C {

  Scanner in = new Scanner(System.in);
  int sols;
  ArrayList<String> possibles = new ArrayList<String>();

  public C() {
    int ncases = in.nextInt();
    for (int i = 0; i < ncases; i++) {
      sols = 0;
      int n = in.nextInt();
      int m = in.nextInt();
      findSolutions(n, m);
      System.out.println("Case #" + (i + 1) + ": " + sols);
      possibles.clear();
    }
  }

  private void findSolutions(int n, int m) {
    while (n < m) {
      findPairs(n, m);
      checkdups();
      possibles.clear();
      n++;
    }
  }

  private void findPairs(int n, int m) {
    String value = Integer.toString(n);
    for (int i = 1; i < value.length(); i++) {
      String nose = value.substring(0, i);
      String ass = value.substring(i, value.length());
      String news = ass.concat(nose);
      compare(value, news, m);
    }
  }

  private void compare(String value, String curvalue, int m) {
    if (Integer.toString(Integer.parseInt(value)).length() == Integer.toString(
        Integer.parseInt(curvalue)).length()) {
      if (Integer.parseInt(curvalue) <= m
          && Integer.parseInt(value) < Integer.parseInt(curvalue)) {
        possibles.add(curvalue);
      }
    }
  }

  private void checkdups() {
    for (int i = 0; i < possibles.size(); i++) {
      for (int x = i + 1; x < possibles.size(); x++) {
        if (possibles.get(i).equals(possibles.get(x))) {
          possibles.remove(x);
        }
      }
    }
    sols += possibles.size();
  }

  public static void main(String[] args) {
    new C();
  }

}
