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.FileNotFoundException;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.Arrays;


public class RecycledNumbers {

	public static void main(String [] args) throws NumberFormatException, IOException {
		java.io.BufferedReader r = new java.io.BufferedReader(
				new java.io.FileReader(
						"C:\\Users\\AhmedMTM\\Desktop\\C-small-attempt0.in"));
		int no = Integer.parseInt(r.readLine());
		int[] results = new int[no];
		Arrays.fill(results, 0);
		for (int t = 0; t < no; t++) {
			String[] input = r.readLine().split(" ");

			int A = Integer.parseInt(input[0]);
			int B = Integer.parseInt(input[1]);
			
			for(int j=B; j>A; j--) {
				for(int k=A; k<j; k++) {
					String one = ""+k;
					String two = ""+j;
					if(one.length() == two.length()) {
						for(int l=0; l<one.length(); l++) {
							if(one.equals(two)) {
								//System.out.println(one);
								results[t]++;
							}
							one = one.substring(one.length()-1, one.length())+one.substring(0, one.length()-1);
						}
					}
				}
			}
			
			try {
				FileWriter outFile = new FileWriter(
						"C:\\Users\\AhmedMTM\\Desktop\\output.txt");
				PrintWriter out = new PrintWriter(outFile);
				for (int i = 0; i < results.length; i++) {
					out.println("Case #"+(i+1)+": "+results[i]);
				}

				out.close();
			} catch (IOException e) {
				e.printStackTrace();
			}

		
		}
	}
}
