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.FileReader;
import java.io.IOException;


public class Recycled {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		int tests;
		try{
			BufferedReader stdin = new BufferedReader(new FileReader(args[0]));
			tests = Integer.parseInt(stdin.readLine());
			for(int i = 0; i < tests; i++){
				System.out.print("Case #"+(i+1) + ": ");
				solve(stdin.readLine());
				System.out.println();
			} 
		}catch(IOException e){
			e.printStackTrace();
		}
		System.exit(0);

	}
	
	private static void solve(String s){
		String [] nums = s.split(" ");
		int a = Integer.parseInt(nums[0]);
		int b = Integer.parseInt(nums[1]);
		int total = 0;
		for(int m = a+1; m <= b; m++){
			for(int n = a; n < m; n++){
				total += canRecycle(n,m);
			}
		}
		System.out.print(total);
	}
	
	private static int canRecycle(int n, int m){
		int total = 0;
		String s = "" + n;
		int len = s.length();
		int[] digits = new int[len];
		boolean descending = true;
		for(int i = 0; i < len-1; i++)
			descending &= (digits[i]>digits[i+1]);
		if(!descending){
			String num = "" + n;
			String match = "" + m;
			num = num.substring(len-1).concat(num.substring(0, len-1));
			while(!num.equals(s)){
				if(num.equals(match))
					total += 1;
				num = num.substring(len-1).concat(num.substring(0, len-1));
			}
			
		}
		//System.out.println(total);
		return total;
	}
}
