
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.*;
import static java.lang.System.*;

public class C
{
	// small input version
	public static String next(String x)
	{
		return x.substring(1)+x.charAt(0);
	}
	public static void main(String[] args)
	{
		Scanner sc = new Scanner(in);
		int t = sc.nextInt();
		boolean[][] match = new boolean[1001][1001];
		for (int i = 1; i <= 1000; i++)
		{
			String str = Integer.toString(i);
			for (int j = 0; j < 4; j++)
			{
				str = next(str);
				int k = Integer.parseInt(str);
				match[Math.min(i,k)][Math.max(i,k)] = true;
			}
		}
		for (int c = 1; c <= t; c++)
		{
			int u = sc.nextInt();
			int v = sc.nextInt();
			int ctr = 0;
			for (int i = u; i <= v; i++)
			{
				for (int j = i+1; j <= v; j++)
				{
					if (match[i][j])
					{
						ctr++;
					}
				}
			}
			out.printf("Case #%d: %d\n", c, ctr);
		}
	}
}

