
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.*;

public class PracticeC
{
	/* ±±©çÒW */
	private static final String fname = "C-small-attempt3.in"; // üÍpÌt@C¼
//	private static final int N = 10000;

	// private static void search(int v)
	// {
	// if (v < 21)
	// return;
	// String in = Integer.toString(v);
	// for (int i = 0; i < in.length(); i++)
	// {
	// String vs = "";
	// for (int j = 0; j < in.length(); j++)
	// {
	// char n = in.charAt((i + j + 1) % in.length());
	// if (vs.equals("") && n == '0')
	// break;
	// vs += n;
	// }
	// // System.out.println(v2);
	// if (vs.equals(""))
	// continue;
	// int v2 = Integer.valueOf(vs);
	// if (v > v2) val[v]++;
	// }
	// }

	private static void search(int v, int A, int B)
	{
		use = new boolean[B+1];
		String in = Integer.toString(v);
		for (int i = 0; i < in.length(); i++)
		{
			String vs = "";
			for (int j = 0; j < in.length(); j++)
			{
				char n = in.charAt((i + j + 1) % in.length());
				if (vs.equals("") && n == '0')
					break;
				vs += n;
			}
			// System.out.println(v2);
			if (vs.equals(""))
				continue;
			int v2 = Integer.valueOf(vs);
			if (v2 >= A && v > v2 && !use[v2])
			{
				use[v2] = true;
				val[v]++;
			}
		}
	}
	public static int val[];
	public static boolean use[];

	public static void solve()
	{
		int T = sc.nextInt();
		// for (int i = 21; i < val.length; i++) search(i);
		// for (int i = 0; i < 100; i++) if(val[i] != 0)
		// System.out.println(i+":"+val[i]);
		for (int i = 1; i <= T; i++)
		{
			int A = sc.nextInt();
			int B = sc.nextInt();
			val = new int[B+1];
			for (int j = A; j <= B; j++)
				search(j, A, B);
			int cnt = 0;
			for (int j = A; j <= B; j++)
			{
//				if(val[j] != 0) System.out.println(j+":"+val[j]);
				cnt += val[j];
			}
//			System.
			out.println("Case #" + i + ": " + (cnt));
		}
	}
	/* ±±ÜÅ */
	private static Scanner sc;
	private static PrintWriter out;
	public static void main(String args[])
	{
		try
		{
			sc = new Scanner(new File(fname));
//			sc = new Scanner(System.in);
			out = new PrintWriter(new BufferedWriter(new FileWriter(new File(fname + "_out.dat"))));
		} catch (Exception e)
		{
			e.printStackTrace();
		}
		solve();
		out.close();
	}

}
