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 );
    }
}

package RecycledNumbers;

import java.io.BufferedReader;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.io.PrintWriter;

public class RecycledNumbers {

	/**
	 * @param args
	 * @throws IOException
	 */
	public static void main(String[] args) throws IOException {
		// TODO Auto-generated method stub
		BufferedReader br = new BufferedReader(new FileReader("RecycledInput"));
		PrintWriter pw = new PrintWriter(new File("RecycledOutput"));

		String cases = br.readLine();
		String line;
		int lines = 1;
		while ((line = br.readLine()) != null) {
			String[] strs = line.split(" ");
			int lowerbound = Integer.parseInt(strs[0]);
			int upperbound = Integer.parseInt(strs[1]);
			int number = lowerbound;
			int count = 0;
//			System.out.println(numberChars.);
			while (number <= upperbound) {
				char[] numberChars = String.valueOf(number).toCharArray();
				for (int i = 0; i < numberChars.length; i++) {
					String recycled = "";
					for (int j = 0; j < numberChars.length; j++)
						recycled += numberChars[(j + i + 1)
								% numberChars.length];
					if (Integer.parseInt(recycled) <= upperbound
							&& Integer.parseInt(recycled) > number) {
						count++;
						System.out.println(number + " " + recycled);
					}
				}
				number ++;
			}
			System.out.println("Case #" + lines + ": " + count);
			pw.write("Case #" + lines + ": " + count + "\n");
			lines++;
		
		}
		pw.flush();
		pw.close();
	}

}
