package it.simone.google.code.jam2012;

import java.util.HashSet;
import java.util.Set;

public class RecycledNumber implements GoogleCodeExercise {

	int a = 0;
	int b = 0;
	Set<Couple> distinctCouple = null;
	long maxTime = 0;

	private class Couple {
		int x = 0;
		int y = 0;

		public Couple(int x, int y) {
			this.x = x;
			this.y = y;
		}

		@Override
		public int hashCode() {
			final int prime = 31;
			int result = 1;
			result = prime * result + getOuterType().hashCode();
			result = prime * result + x;
			result = prime * result + y;
			return result;
		}

		@Override
		public boolean equals(Object obj) {
			if (this == obj)
				return true;
			if (obj == null)
				return false;
			if (getClass() != obj.getClass())
				return false;
			Couple other = (Couple) obj;
			if (!getOuterType().equals(other.getOuterType()))
				return false;
			if (x == other.x && y == other.y)
				return true;
			if (x == other.y && y == other.x)
				return true;
			return false;
		}

		private RecycledNumber getOuterType() {
			return RecycledNumber.this;
		}

	}

	@Override
	public String execute(String line) {
		int result = 0;

		String[] data = line.split(" ");
		a = Integer.parseInt(data[0]);
		b = Integer.parseInt(data[1]);
		initialize();

		int n = a;
		//
		while (n <= b) {
			result += analize(n);
			n++;
//			if (n % 1000 == 0)
//				System.out.println(n);
		}

		System.out.println(result);
		return "" + result;
	}

	@Override
	public void initialize() {
		distinctCouple = new HashSet<Couple>();
	}

	private int analize(int number) {
		String numString = "" + number;
		initialize();
		for (int i = 1; i < numString.length(); i++) {
			int m = shift(numString, i);
			if (a <= number && number < m && m <= b) {
				Couple couple=new Couple(number,m);
				if (!distinctCouple.contains(couple))
					distinctCouple.add(couple);
			}
		}
		return distinctCouple.size();
	}

	private int shift(String numString, int posx) {

		String result = null;
		result = "" + numString.substring(posx) + numString.substring(0, posx);

		return Integer.parseInt(result.toString());
	}

}


import java.io.BufferedReader;
import java.io.InputStreamReader;

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */


/**
 *
 * @author andy
 */
public class RecycledNumbers {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) throws Exception {
        
        //char sd = '1';
        //int[] sdf = new int[ 10 ];
        
        //System.out.println( sdf[ 0 ] );
        
        
        
        BufferedReader in = new BufferedReader(new InputStreamReader(System.in)); 
        
        String s = in.readLine();
        
        int numTestCases = Integer.parseInt(s);
        
        int a;
        int b;
        
        int len;
        
        for( int testCase = 1 ; testCase <= numTestCases ; testCase ++ )
        {
            int count = 0;
            
            String ab = in.readLine();
            
            String[] arrAB = ab.split(" ");
            a = Integer.parseInt(arrAB[0]);
            b = Integer.parseInt(arrAB[1]);
            
            //System.out.println( "ab: " + a + " " + b);
            
            int[] appearedInThisCycle = new int[numTestCases];
            
            char[] arrA;
            // arrA = arrAB[0].toCharArray();
            
            //len = arrA.length;
            
            for( int n = a ; n < b ; n ++ )
            {
                arrA = String.valueOf(n).toCharArray();
                len = arrA.length;
                
                int[] cycleArr = new int[ len ];
                
                for( int c = 0 ; c < len ; c ++)
                {
                    int aValue = 0;
                    
                    for( int ai = 0 ; ai < len ; ai ++)
                    {
                        aValue += Math.pow(10, ai) * Character.digit(arrA[ (c - ai + len) % len ],10);
                    }
                    
                    cycleArr[ c ] = aValue;
                    
                    boolean hasntAlreadyAppeared = true;
                    
                    for( int i = 0 ; i < c ; i ++ )
                    {
                        if( cycleArr[i] == aValue )
                        {
                            //System.out.println(":" + cycleArr[c] + " " + aValue);
                            hasntAlreadyAppeared = false;
                            //break;
                        }
                    }
                    
                    
                    
                    if( hasntAlreadyAppeared && aValue > n && aValue <= b )
                    {
                        //System.out.println(n + " and " + aValue );
                        
                        count ++;
                    }
                    
                    
                }
                
                
                
                
                
                
                
                
            }
            
            
            System.out.println("Case #" + testCase + ": " + count );
            
        }
    }
}
