/*
 * 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.io.File;
import java.io.FileNotFoundException;
import java.util.Scanner;
import java.util.HashSet;
import java.io.FileWriter;

public class RecyclingNumbers {
  public static void main(String... args) {
    RecyclingNumbers obj = new RecyclingNumbers();
    obj.run();
  }
  public void run() {
    
    try {
      File f = new File("C-small-attempt0.in");
      File outFile = new File("output.txt");
      FileWriter w = new FileWriter(outFile);
      Scanner s = new Scanner(f);
      int T = s.nextInt();
      s.nextLine();
      for(int i = 1; i<= T; i++) {
        int lower = s.nextInt();
        int upper = s.nextInt();
        int maxRecycled = findRecycled(lower, upper);
        String str = "Case #" + i +": " + maxRecycled + '\n';
        w.write(str);
        if(s.hasNextLine()) s.nextLine();
      }
      w.close();
    }
    catch(Exception e) {
      System.out.println(e.toString());
    }
  }
  private int findRecycled(int lower, int upper) {
    int recycled = 0;
    HashSet<Pair> set = new HashSet<Pair>();
    for(int n = lower; n <= upper; n++) {
      String current = (new Integer(n)).toString();
      for(int r = 0; r < current.length(); r++) {
        String check = current.substring(1) + current.charAt(0);
        int m = Integer.parseInt(check);
        if( lower <= n) {
          if(n < m) {
            if( m <= upper) {
              set.add(new Pair(n,m));
            }
          }
        }
        current = check;
      }
    }
    return set.size();
  }
  
  private class Pair {
    public int x, y;
    public Pair(int x, int y) {
      this.x = x;
      this.y = y;
    }
    public boolean equals(Object obj)
    {
      if(this == obj)
        return true;
      if((obj == null) || (obj.getClass() != this.getClass()))
        return false;
      Pair p = (Pair)obj;
      return x == p.x && y == p.y;
    }
    
    public int hashCode()
    {
      int hash = 7;
      hash = 31 * hash + x;
      hash = 31 * hash + y;
      return hash;
    }
  }
}
