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

}
import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;


public class RecycledNumbers 
{
	public RecycledNumbers()
	{
		
	}
	public int getNumDigits(int x)
	{
		if(x == 0 || x == 1)
			return 1;
		int counter =0 ;
		int check = 1;
		while(check<=x)
		{
			counter ++ ;
			check*=10;
		}
		return counter;
	}
	public int traverse(int x, int i)
	{
		if(x<10)
			return x ;
		int y = x/((int)Math.pow(10,i+1));
		int lastDigits = x-(y * (int)Math.pow(10,i+1));
		return ((int)Math.pow(10, getNumDigits(y))*lastDigits )+ y;
	}
	public boolean isRecycled(int x, int y)
	{
		int numOFDigits = getNumDigits(x);
		int z = x ;
		for(int i=0 ; i <numOFDigits ; i++)
		{
			if(y == z)
				return true ;
			z = traverse(x , i);
		}
		return false ;
	}
	public int numOfRecycledNum(int a , int b)
	{
		int counter  = 0;
		for(int i =a ; i <= b ; i++)
		{
			for(int j = i+1 ; j <= b ; j++)
			{
				if(isRecycled(i, j))
				{
					counter ++ ;
				}
			}
		}
		return counter ;
	}
	public static void perform()
	{
		RecycledNumbers recycled= new RecycledNumbers();
		try {
			BufferedReader inputStream = new BufferedReader(new FileReader("C-small-attempt0.in"));
			PrintWriter outputStream = new PrintWriter(new FileWriter("Output.txt"));
			try
			{
			int numOfLines = Integer.parseInt(inputStream.readLine());
			for(int i=1 ; i<=numOfLines ; i++)
			{
				String line = inputStream.readLine();
				boolean firstNum = true ;
				String num1 = "", num2 = "";
				for(int j=0 ; j< line.length() ; j++)
				{
					if(line.charAt(j) == ' ')
					{
						firstNum = false ;
						j++;
					}
					if(firstNum)
						num1 += line.charAt(j);
					else
						num2 += line.charAt(j);
				}
				int x = Integer.parseInt(num1);
				int y = Integer.parseInt(num2);
				String toOutput = "Case #"+i+": ";
				toOutput += recycled.numOfRecycledNum(x, y);
				outputStream.println(toOutput);
			}
			}catch(Exception e)
			{
				//no input in the file
				//or there was a problem in one of the lines
				//or there is a line that doesn't exist
			}
			inputStream.close();
			outputStream.close();
		} catch (FileNotFoundException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}
	}
	public static void main(String args[])
	{
		perform();
	}
}
