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.FileInputStream;
import java.io.InputStreamReader;


public class RecycledNumbers {
	
	public static void main(String[] args) {
		
		try {
		
//			int T = 4;
//			int[][] testcases = new int[T][];
//			testcases[0] = new int[]{1,9};
//			testcases[1] = new int[]{10,40};
//			testcases[2] = new int[]{100,500};
//			testcases[3] = new int[]{1111,2222};
			
			BufferedReader reader = new BufferedReader(new InputStreamReader(new FileInputStream("C-small-attempt0.in")));
			
			String firstLine = reader.readLine();
			int T = Integer.valueOf(firstLine);
			int[][] testcases = new int[T][];
			
			for(int i = 0; i < T; i++) {
				String[] testcase = reader.readLine().split(" ");
				testcases[i] = new int[2];
				testcases[i][0] = Integer.valueOf(testcase[0]);
				testcases[i][1] = Integer.valueOf(testcase[1]);				
			}
			
			RecycledNumbers recylcing = new RecycledNumbers();
			
			for(int i = 0; i < T; i++) {
				System.out.printf("Case #%d: ",i+1,testcases[i]);
				int result = recylcing.count(testcases[i]);
				System.out.printf("%s\n", result);
			}
			
		}
		catch(Exception ex) {
			System.out.println("An error occured:\n");
			ex.printStackTrace();
		}
		
		
	}
	
	public int count(int[] input) {
		
		int A = input[0];
		int B = input[1];
		
		int hits = 0;
		
		for(int i = 0; i <= B - A; i++) {
			for(int j = 0; j <= B - A; j++) {
				
				int lessB = B - i;
				int moreA = A + j;
				
				if(lessB >= moreA) {
				
					int switchA = moreA;
					do {
						if(lessB == switchA && switchA > moreA) {
							hits++;
							break;
						}
						char[] chars = Integer.toString(switchA).toCharArray();
						chars = rotateCharacters(chars);
						switchA = Integer.valueOf(String.valueOf(chars));
					} while (moreA != switchA);
					
				}
				else {
					break;
				}
				
			}
		}
		
		return hits;
		
	}
	
	public char[] rotateCharacters(char[] chars) {
		if(chars.length > 1) {
			char charNext = chars[1];
			chars[1] = chars[0];
			for(int i = 1; i < chars.length - 1; i++) {
				char charNextNext = chars[i+1];
				chars[i+1] = charNext;
				charNext = charNextNext;
			}
			chars[0] = charNext;
			if(chars[0] == '0') {
				return rotateCharacters(chars);
			}
			else {
				return chars;
			}
		}
		else {
			return chars;
		}
	}

}
