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

import java.util.HashSet;

/**
 *
 * @author vandit
 */
public class RecycleNumbers {

    private HashSet<String> numbers = new HashSet<String>();
    private HashSet<String> initialTempNumbers = new HashSet<String>();
    private HashSet<String> finalTempNumbers = new HashSet<String>();

    HashSet<Pair> numberPairs = new HashSet<Pair>();


    private void findRecycledNumbers(int start, int end, int places) {


        for (int i = start; i <= end; i++) {
            String initialNumber = Integer.toString(i);
            //if (!(numbers.contains(initialNumber) || finalTempNumbers.contains(initialNumber))) {

                StringBuffer tempNumber = new StringBuffer(initialNumber);
                int len = tempNumber.length();
                int startIndexToMove = len - places;
                String tempString = tempNumber.substring(startIndexToMove);
                if ((places == 1 && tempString.equals("0")) || tempString.charAt(0) == '0') {
                    continue;
                }
                tempNumber.delete(startIndexToMove, len);
                String finalTempNumber = tempString + tempNumber.toString();

                if (! (finalTempNumber.equals(initialNumber) || Integer.parseInt(finalTempNumber) > end || Integer.parseInt(finalTempNumber) < Integer.parseInt(initialNumber))) {
                    numbers.add(initialNumber);
                    finalTempNumbers.add(finalTempNumber);
                    Pair pair = new Pair(finalTempNumber,initialNumber);
                    numberPairs.add(pair);
                }
            }

        

    }

    public HashSet<Pair> findAllRecycledNumbers(int start, int end) {
        int length = Integer.toString(start).length();
        for (int i = 1; i < length; i++) {
            findRecycledNumbers(start, end, i);
        }
        return numberPairs;
    }
}

import java.util.*;
import java.io.*;

public class Recycled {

  public static void main(String[] args) {
    Recycled d = new Recycled();
    d.run();
  }

  public Recycled() {}


  public boolean isRecyclable(int n, int m) {
    boolean result = false;
    String mStr = m + "";
    String nStr = n + "";

    if (mStr.length() == 1) {
        return result;
    } 


    for (int i = 1; i < mStr.length(); i++) {
        String newM = mStr.substring(i) + mStr.substring(0, i);
        if (newM.equals(nStr)) {
            result = true;
            break;
        }
    }

    return result;
  }


  public void run() {
    Scanner sc = new Scanner(System.in);
    int testCases = sc.nextInt();

    for (int i = 0; i < testCases; i++) {
      int a = sc.nextInt();
      int b = sc.nextInt();

      int n = 0;
      int m = 0;

      int recyclable = 0;
      for (n = a; n < b; n++) {
        for (m = n+1; m <= b; m++) {
           if (isRecyclable(n, m)) {
             recyclable++;
           }
        }
      }

      System.out.println("Case #" + (i+1) + ": " + recyclable);
    }
  }
}

