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.FileInputStream;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		ArrayList<String> answer = read("/home/zehortigoza/Downloads/codejam/c/input.txt");
		int tt = 0;
		int amount = 1;
		for (int i = 0; i < answer.size(); i++) {
			String line = answer.get(i);
			if (i == 0) {
				tt = Integer.parseInt(line);
			} else {
				if (tt >= amount) {
					HashMap<String, Boolean> count = new HashMap<String, Boolean>();

					String[] splited = line.split(" ");
					String a = splited[0];
					String b = splited[1];
					int aInt = Integer.parseInt(a);
					int bInt = Integer.parseInt(b);

					if (! (a.length() == 1 && b.length() == 1)) {
						ArrayList<Integer> range = range(aInt, bInt);
						
						for (int z = 0; z < range.size(); z++) {
							String currentN = range.get(z)+"";
						    String currentM = range.get(z)+"";
						    int length = currentM.length();
						    
						    for (int j = 0; j < length; j++) {
						    	currentM = currentM.charAt(length-1) + currentM.substring(0, length - 1);
							    
							    int currentNInt = Integer.parseInt(currentN);
							    int currentMInt = Integer.parseInt(currentM);
							    
							    if (currentMInt <= bInt && currentMInt > currentNInt && currentMInt >= aInt) {							    	
							    	if(count.get(currentN+currentM) == null) {
							    		count.put(currentN+currentM, true);
							    	}						    	
						        }
						    }
						}
					}

					System.out.println("Case #" + amount + ": " + count.size());
					amount++;
				}
			}
		}
	}

	private static ArrayList<Integer> range(int start, int end) {
		ArrayList<Integer> list = new ArrayList<Integer>();
		if (start > end) {
			System.out.println("error to build range");
			return null;
		}

		for (int i = start; i <= end; i++) {
			list.add(i);
		}
		return list;
	}

	private static ArrayList<String> read(String url) {
		ArrayList<String> lines = new ArrayList<String>();
		Scanner scanner = null;
		try {
			scanner = new Scanner(new FileInputStream(url));
			while (scanner.hasNextLine()) {
				lines.add(scanner.nextLine());
			}
		} catch (Exception e) {
			e.printStackTrace();
		} finally {
			if (scanner != null) {
				scanner.close();
			}
		}
		return lines;
	}
}
