package jp.funnything.competition.util;

import java.math.BigInteger;

/**
 * Utility for BigInteger
 */
public class BI {
    public static BigInteger ZERO = BigInteger.ZERO;
    public static BigInteger ONE = BigInteger.ONE;

    public static BigInteger add( final BigInteger x , final BigInteger y ) {
        return x.add( y );
    }

    public static BigInteger add( final BigInteger x , final long y ) {
        return add( x , v( y ) );
    }

    public static BigInteger add( final long x , final BigInteger y ) {
        return add( v( x ) , y );
    }

    public static int cmp( final BigInteger x , final BigInteger y ) {
        return x.compareTo( y );
    }

    public static int cmp( final BigInteger x , final long y ) {
        return cmp( x , v( y ) );
    }

    public static int cmp( final long x , final BigInteger y ) {
        return cmp( v( x ) , y );
    }

    public static BigInteger div( final BigInteger x , final BigInteger y ) {
        return x.divide( y );
    }

    public static BigInteger div( final BigInteger x , final long y ) {
        return div( x , v( y ) );
    }

    public static BigInteger div( final long x , final BigInteger y ) {
        return div( v( x ) , y );
    }

    public static BigInteger mod( final BigInteger x , final BigInteger y ) {
        return x.mod( y );
    }

    public static BigInteger mod( final BigInteger x , final long y ) {
        return mod( x , v( y ) );
    }

    public static BigInteger mod( final long x , final BigInteger y ) {
        return mod( v( x ) , y );
    }

    public static BigInteger mul( final BigInteger x , final BigInteger y ) {
        return x.multiply( y );
    }

    public static BigInteger mul( final BigInteger x , final long y ) {
        return mul( x , v( y ) );
    }

    public static BigInteger mul( final long x , final BigInteger y ) {
        return mul( v( x ) , y );
    }

    public static BigInteger sub( final BigInteger x , final BigInteger y ) {
        return x.subtract( y );
    }

    public static BigInteger sub( final BigInteger x , final long y ) {
        return sub( x , v( y ) );
    }

    public static BigInteger sub( final long x , final BigInteger y ) {
        return sub( v( x ) , y );
    }

    public static BigInteger v( final long value ) {
        return BigInteger.valueOf( value );
    }
}

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

public class C {
  public static void main(String[] args) throws Exception {
    Scanner sc = new Scanner(new FileReader("C-small-attempt0.in"));
    PrintWriter pw = new PrintWriter(new FileWriter("C-small-output.txt"));
    int T = sc.nextInt();
    int result;
    for (int k=1; k <= T; k++) {
      int A = sc.nextInt();
      int B = sc.nextInt();
      Hashtable<Integer, String> allResults = new Hashtable<Integer, String>();
      String nString = "" + A;
      int numDigits = nString.length();     // find number of digits
      
      result = 0;
      for (int n=A; n<B; n++) {
        nString = "" + n;
        for (int j=0; j<numDigits; j++) {
          String recycleString = nString.substring(j) + nString.substring(0,j);
          int recycled = Integer.parseInt(recycleString);
          if ( (recycled>n) && (recycled<=B) ) {
            String mn = n + "," + recycled;
            if (!allResults.contains(mn)) {
              allResults.put(mn.hashCode(), mn);
              result++;
            }
          }
        }
      }
      System.out.format("Case #%d: %d\n", k, result);
      pw.format("Case #%d: %d\n", k, result);
    }
    
    pw.flush();
    pw.close();
    sc.close();
  }
}