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

import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.util.ArrayList;




public class testapp {

	/**
	 * @param args
	 */
	
	public static void main(String[] args) {
		 StringBuilder contents = new StringBuilder();
		 int totalCase=0;
		 int aVar[]=null,bVar[]=null;
		 int loop=-1;
		 
		    
		    try {
		    String aFile="c:\\testapp.txt";
		      BufferedReader input =  new BufferedReader(new FileReader(aFile));
		      try {
		        String line = null; 
		        while (( line = input.readLine()) != null){
		          if(loop==-1)
		          {
		        	  System.out.println(line.trim());
		        	totalCase =Integer.parseInt(line);
		        	aVar =new int[totalCase];
		        	bVar =new int[totalCase];
		        	loop++;
		        	continue;
		          }
		          String[] result = line.split("\\s");
		          aVar[loop]=Integer.parseInt(result[0]);
		          bVar[loop]=Integer.parseInt(result[1]);
		          loop++;
		        }
		      }
		      finally {
		        input.close();
		      }
		    }
		    catch (IOException ex){
		      ex.printStackTrace();
		    }
		
		
		for(int caseid=0;caseid<totalCase;caseid++)
		{
			int a=aVar[caseid];
			int b=bVar[caseid];
			int num=a;
		
		ArrayList<String> matchlist=new ArrayList<String>();
	
		while(num<=b)
		{
			
		checkpairs(num,a,b,matchlist);
		num++;
			
		}
		
		System.out.println("Case #"+(caseid+1)+": "+matchlist.size());
		}

	}
	
	public static int checkpairs(int num,int a, int b,ArrayList<String> matchlist)
	{
		int count=0;
		int rnd=1;
		int m;
		double div;
		int size=String.valueOf(num).trim().length();
		while(rnd<size)
		{
			
			div=num/Math.pow(10, rnd);
			m=(int)(num%Math.pow(10, rnd)*Math.pow(10, size-rnd))+(int)(Math.floor(div));
	
			if(m>=a && m<=b && m!=num )
			{
				if(!(matchlist.contains(num+"-"+m)|| matchlist.contains(m+"-"+num)))
					matchlist.add(num+"-"+m);
			}
			
			rnd++;
		}
	
		return count;
	}

}
