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.util.ArrayList;

public class Run3
{
	private static class Pair
	{
		private String n;
		private String m;
		
		public Pair(String n, String m)
		{
			this.n = n;
			this.m = m;
		}
		
		public String getStringN()
		{
			return n;
		}
		
		public String getStringM()
		{
			return m;
		}
		
		public int getIntegerN()
		{
			return Integer.parseInt(n);
		}
		
		public int getIntegerM()
		{
			return Integer.parseInt(m);
		}
		
		@Override
		public boolean equals(Object obj)
		{
			Pair pair = (Pair)obj;
			if ((pair.getStringN().equals(this.n) && pair.getStringM().equals(this.m)) ||
				(pair.getStringN().equals(this.m) && pair.getStringM().equals(this.n)))
			{
				return true;
			}
			else
			{
				return false;
			}
		}
		
		@Override
		public String toString()
		{
			return n+" "+m;
		}
	}
	public static void main(String[] args)
	{
		String path = "files/C-small-attempt1.in";
		
		int T = 0;
		ArrayList<Integer> A = new ArrayList<Integer>();
		ArrayList<Integer> B = new ArrayList<Integer>();
		
		ArrayList<Pair> pairs = new ArrayList<Pair>();
		try
		{
			boolean isFirstLine = true;
			
			FileReader FR = new FileReader(path);
			BufferedReader BR = new BufferedReader(FR);
			String str = "";
			
			while((str=BR.readLine())!=null)
			{
				if (isFirstLine)
				{
					T = Integer.parseInt(str);
					isFirstLine = false;
				}
				else
				{
					String[] temp = str.split(" ");
					
					A.add(Integer.parseInt(temp[0]));
					B.add(Integer.parseInt(temp[1]));
				}
			}
		}
		catch (Exception e)
		{
			e.printStackTrace();
		}
		
		for (int i = 0; i < T; i++)
		{
			pairs.clear();
			int start = A.get(i);
			int end = B.get(i);
			
			for (int j = start; j <= end; j++)
			{
				String n = String.valueOf(j);
				String m = "";
				for (int x = 1; x < n.length() ; x++)
				{
					m = moveDigital(n, x);
					if (start <= Integer.parseInt(n) && Integer.parseInt(n) < Integer.parseInt(m) && Integer.parseInt(m) <= end)
					{
						Pair pair = new Pair(n, m);
						if (!pairs.contains(pair))
						{
							pairs.add(pair);
						}
					}
				}
			}
			System.out.println("Case #"+(i+1)+": "+pairs.size());
		}
	}
	
	static public String moveDigital(String number, int digitals)
	{
		return number.substring(number.length()-digitals, number.length())+number.substring(0, number.length()-digitals);
	}
}