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.BufferedReader;
import java.io.File;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.*;


public class GoogleCodeInP3{
    
    //processing file
    public static void main(String[] args) throws IOException {
        BufferedReader dog = new BufferedReader(new FileReader(args[0]));
        int a = -1;
        try {
            a = Integer.parseInt(dog.readLine());
        }
        catch (Exception e) { }
        FileWriter file = new FileWriter("outputFile8");
        BufferedWriter cat = new BufferedWriter(file);
        for (int i = 0; i < a; i++) {
            String line = dog.readLine();
            String[] barf= line.split(" ");
            cat.write("Case #" + (i + 1) + ": " + GoogleCodeInP3.solver(Integer.parseInt(barf[0]),Integer.parseInt(barf[1])));
            if (i < a - 1) { 
                cat.write("\n"); 
            }
        }
        cat.close();
    }
    
    
    
    public static int solver(int a, int b){
        int totalRecycledPair = 0; // returns the total number of recyled pairs 
        int m= a+1;
        for (int n= a; n < m; n++){
               for (m= n + 1; m < b+1; m++){
                   if ((m+"").length() == (n+"").length()){
                       String interN= n+"";
                       if (Integer.parseInt(interN) == m){
                           totalRecycledPair++;
                       }
                       for (int i= 0; i < interN.length(); i++){
                           interN= interN.charAt(interN.length()-1) + interN.substring(0,interN.length()-1);
                           if (Integer.parseInt(interN) == m){
                               totalRecycledPair++;
                           }
                       }
                   }
                }
         }
       return totalRecycledPair;
    }
}