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.util.HashMap;
import java.util.HashSet;
import java.util.Map;
import java.util.Scanner;
import java.util.Set;

public class Main {
	public Scanner sc;
	public Map<Character, Character> mapping = new HashMap<Character, Character>();

	public static void main(String[] args) {
		Main m = new Main();
		m.start();
	}

	public void start() {
		sc = new Scanner(System.in);
		int t = sc.nextInt();
		for (int i = 1; i <= t; i++) {
			System.out.print("Case #" + i + ": ");
			solve();
		}
	}

	public void solve() {
		int a = sc.nextInt();
		int b = sc.nextInt();
		int ans = 0;
		Set<String> checked = new HashSet<String>();

		for (int n = a; n <= b; n++) {
			if (n < 10 || n == 1000) {
				continue;
			}

			char[] charArr = Integer.toString(n).toCharArray();

			if (charArr.length == 2) {
				if (charArr[1] != '0') {
					char[] newChar = { charArr[1], charArr[0] };
					int newInt = Integer.valueOf(String.valueOf(newChar));
					if (!checked.contains(n + " " + newInt) && n < newInt && newInt >= a && newInt <= b) {
						checked.add(n + " " + newInt);
						ans++;
					}
				}
			} else if (charArr.length == 3) {
//				if (charArr[0] != '0') {
//					char[] newChar1 = { charArr[0], charArr[2], charArr[1] };
//					int newInt = Integer.valueOf(String.valueOf(newChar1));
//					if (!checked.contains(n + " " + newInt) && n < newInt && newInt >= a && newInt <= b) {
//						checked.add(n + " " + newInt);
//						ans++;
//					}
//				}
				if (charArr[1] != '0') {
//					char[] newChar2 = { charArr[1], charArr[0], charArr[2] };
//					int newInt = Integer.valueOf(String.valueOf(newChar2));
//					if (!checked.contains(n + " " + newInt) && n < newInt && newInt >= a && newInt <= b) {
//						checked.add(n + " " + newInt);
//						ans++;
//					}
					char[] newChar3 = { charArr[1], charArr[2], charArr[0] };
					int newInt = Integer.valueOf(String.valueOf(newChar3));
					if (!checked.contains(n + " " + newInt) && n < newInt && newInt >= a && newInt <= b) {
						checked.add(n + " " + newInt);
						ans++;
					}
				}
				if (charArr[2] != '0') {
					char[] newChar4 = { charArr[2], charArr[0], charArr[1] };
					int newInt = Integer.valueOf(String.valueOf(newChar4));
					if (!checked.contains(n + " " + newInt) && n < newInt && newInt >= a && newInt <= b) {
						checked.add(n + " " + newInt);
						ans++;
					}
//					char[] newChar5 = { charArr[2], charArr[1], charArr[0] };
//					newInt = Integer.valueOf(String.valueOf(newChar5));
//					if (!checked.contains(n + " " + newInt) && n < newInt && newInt >= a && newInt <= b) {
//						checked.add(n + " " + newInt);
//						ans++;
//					}
				}
			}
		}
		System.out.println(ans);
//		for (String string : checked) {
//			System.out.println(string);
//		}
//		System.out.println(checked.size());
	}
}
