
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 googlers;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.DataInputStream;
import java.io.File;
import java.io.FileInputStream;
import java.io.FileWriter;
import java.io.InputStreamReader;

public class Mainclass {
	String line[];
	int bv=1;
	Mainclass(){
		line=new String[50];
		FileInputStream fstream;
		DataInputStream in;
		BufferedReader br;
		try{
			fstream = new FileInputStream("in.txt");
			in = new DataInputStream(fstream);
			br = new BufferedReader(new InputStreamReader(in));
			int x=Integer.parseInt(br.readLine());
			for(int z=0;z<x;z++){
				line[z]=br.readLine();
				tranform(line[z]);
			}
		}catch(Exception e){
			e.printStackTrace();
		}
	}
	
	private void tranform(String string) {
		String A[];
		int count=0;
		int z=0;
		A=string.split(" ");
		int a=Integer.parseInt(A[0]);
		int b=Integer.parseInt(A[1]);
		//System.out.println(a+ " " +b);
		int len=new Integer(a).toString().length();
		for(int x=a;x<=b;x++){
			String test=new String(x+"");
			String temp=test;
			for(int y=0;y<len-1;y++){
				temp=temp.charAt(len-1)+temp.substring(0,len-1);
				int testn=Integer.parseInt(temp);
				//System.out.println(testn);
			
				if(testn==x)continue;
				if(testn<a||testn>b)
					continue;
				z++;
			}
				
				
			}
		
		System.out.println(z/2);
		String output=new String(z/2+"");
		try{
			File file = new File("out.txt");
			FileWriter fileWritter = new FileWriter(file.getName(),true);
	        BufferedWriter bufferWritter = new BufferedWriter(fileWritter);
			bufferWritter.write(new String("Case #"+bv+": "+output+"\n"));
	        System.out.println("Case #"+bv+": "+output+"\n");
	        bv++;
	        bufferWritter.close();
	        

		}catch(Exception e){
			e.printStackTrace();
		}
	}

	public static void main(String args[]){
		new Mainclass();
		
	}
	
}
