
import java.util.Scanner;
import java.util.Set;
import java.util.TreeSet;
import java.io.File;
import java.io.IOException;
import java.io.FileWriter;
import java.io.BufferedWriter;

public class Recycle
{
	public static void main(String[] args)
	{
/*		Set<Integer> perms = getPermutations(123456);
		
		for(Integer i: perms)
			System.out.println(i);*/
	
		try
		{
			Scanner s = new Scanner(new File("recycle.in"));
			BufferedWriter w = new BufferedWriter(new FileWriter(new File("recycle.out")));
			int numCases = s.nextInt();
			s.nextLine();
			
			for(int n = 1;n <= numCases; n++)
			{
				int A = s.nextInt();
				int B = s.nextInt();
				int count = 0;
				for(int k = A; k <= B; k++)
				{
					count += getNumPairs(k, B);
				}
				
				w.write("Case #" + n + ": " + count + "\n");
			}
			
			w.flush();
			w.close();
		}
		catch (IOException e)
		{
			e.printStackTrace();
		}
	}
	
	public static int getNumPairs(int n, int B)
	{
		Set<Integer> possibles = getPermutations(n);
		int count = 0;
		for(Integer i : possibles)
			if(i > n && i <= B)
				count++;
		return count;
	}
	
	public static Set<Integer> getPermutations(int n)
	{
		Set<Integer> perms = new TreeSet<Integer>();
		char[] digits = String.valueOf(n).toCharArray();
		
		for(int firstPos = 1; firstPos < digits.length; firstPos++)
		{
			String toBuild = "";
			for(int k = 0; k < digits.length; k++)
				toBuild += digits[(firstPos + k) % digits.length];
			perms.add(Integer.parseInt(toBuild));
		}
		return perms;
	}
	

}
package Qualification;

import java.util.*;
import java.io.*;

public class C {
	
	private static boolean checkRecycling2( String n, String m ){
		String last;
		String first;
		int status = 0;
		for( int pos=n.length()-1; pos>0; pos-- ){
			
			last = n.substring(pos);
			first = n.substring(0, pos);
			
			//System.out.println( last + " " + first );
			
			//new Scanner(System.in).nextLine();
			
			if( (last+first).equals( m )){
				return true;
			}
		}
		
		return false;
	}
	
	private static boolean checkRecycling( String n, String m ){
		boolean flag = true;
		int sz = n.length(), mPos;
		for( int pos=sz-1; pos>0; pos-- ){
			flag = true;
			mPos = 0;
			
			for( int i=pos; i<sz; i++ ){
				if( n.charAt(i) != m.charAt( mPos++ ) ){
					flag = false;
					break;
				}
			}
			
			if( !flag ) continue;
			flag = true;
			
			for( int i=0; i<pos; i++ ){
				if( n.charAt(i) != m.charAt( mPos++ ) ){
					flag = false;
					break;
				}
			}
			
			if( flag )
				return true;
			
		}
		
		return false;
	}
	
	private static int getRecycled(String... split) {
		int times=0;
		int a = Integer.parseInt(split[0]);
		int b = Integer.parseInt( split[1] );
		
		String nS, mS;
		
		for( int n=a; n<b; n++ ){
			for( int m=n+1; m<=b; m++ ){
				
				nS = String.format("%d", n);
				mS = String.format("%d", m);
				
				//System.out.println( nS + " " + mS );
				
				if( checkRecycling( nS, mS ) ){
					times++;
				}
				
			}
		}
		
		return times;
	}
	
	public static void main(String[] args) throws FileNotFoundException {
		
		Scanner in = new Scanner( new File( "C-small-attempt1.in" ) );
		//Scanner in = new Scanner( new File( "A-large.in" ) );
		PrintWriter out = new PrintWriter( new FileOutputStream( new File( "outC.txt" ) ), true );
		
		long cases;
		
		cases = Long.parseLong( in.nextLine() );
		
		String input;
		for( long i=0; i<cases; i++  ){
			out.print("Case #" + (i+1) + ": ");
			/*
			 * START 
			 */
			
			input = in.nextLine();
			
			out.print( getRecycled( input.split(" ") ) );
			
			/*
			 *  END
			 */
			out.println();
		}

	}

	



	

}
