
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.*;
import java.util.*;

class Recycled
{
	int n;
	int m;

	Recycled (int a, int b)
	{
		n=a;
		m=b;
	}

	boolean isEqual(int a, int b)
	{
		if (n == a && m == b)
			return true;
		else
			return false;
	}
}

class C
{
	public static void main(String args[]) throws FileNotFoundException
	{
		Scanner in = new Scanner(new File(args[0]));

		int t;

		t = Integer.parseInt(in.nextLine());

		for (int i=0; i<t; i++)
		{
			int a = in.nextInt();
			int b = in.nextInt();
			int s = 0;
			ArrayList<Recycled> recs = new ArrayList<Recycled>();

			for (int n=a; n<b; n++)
			{
				String x = String.valueOf(n);
				String y = new String();
				for (int j=0; j<x.length()-1; j++)
				{
					y = x.substring(j+1) + x.substring(0,j+1);
					int m = Integer.parseInt(y);
					if ( n < m && m <= b)
					{
						boolean distinct = true;
						for (Recycled rec: recs)
						{
							if (rec.isEqual(n,m))
							{
								distinct = false;
								break;
							}	
						}

						if (distinct)
						{
							recs.add(new Recycled(n,m));
							s++;
						}
					}
				}

			}
			
			System.out.println("Case #" + (i+1) + ": " + s);
		}

	}
}
