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 );
    }
}

// Mario Morales

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

public class p3{
  public static void main(String[] args) throws Exception{
  	BufferedReader f = new BufferedReader(new FileReader("input3small.txt"));
  	PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter("answer3small.txt")));

    //Brute Force Solution
    int t = Integer.parseInt(f.readLine()); //# of test cases
    StringTokenizer st;
    int a, b, d, res;
    String aNew;
    for(int i=0; i<t; i++){
        st = new StringTokenizer(f.readLine());
        a = Integer.parseInt(st.nextToken());//bounds
        b = Integer.parseInt(st.nextToken());
        d = (""+a).length();//number of digits
        res = 0;

        for(int a1=a; a1<b; a1++){
            for(int b1=a1+1; b1<=b; b1++){
                //move n rightmost digits
                for(int n=1; n<d; n++){
                    aNew = (""+a1).substring(d-n, d) + (""+a1).substring(0, d-n);
                    if(aNew.equals(""+b1)){
                        res++;
                        break;
                    }
                }
            }
        }
    	out.println("Case #" + (i+1) + ": " + res);
    }

    out.close();
    System.exit(0);
  }
}
