import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;
import java.util.Set;

public class CopyOfCopyOfMain {

	static int ndigits(int n) {
		return (int) (Math.log10(n) + 1);
	}

	static int rot(int n, int dig) {
		return (int) ((n % 10) * Math.pow(10, dig - 1)) + (int) (n / 10);
	}

	public static void main(String[] args) throws FileNotFoundException {
		String file = "C-large";
		Scanner in = new Scanner(new File(file + ".in"));
		PrintWriter out = new PrintWriter(new File(file + ".out"));

		int T = in.nextInt();
		for (int t = 1; t <= T; t++) {
			int A = in.nextInt();
			int B = in.nextInt();

			int c = 0;
			int[] list = new int[ndigits(B)];
			numbers: for (int i = A; i <= B; i++) {
				int digs = ndigits(i);
				int rot = i;
				int pairs = 0;

				Arrays.fill(list, -1);
				list[0] = i;

				digits: for (int j = 1; j <= digs + 1; j++) {

					rot = rot(rot, digs);
					if(rot < i)
						continue;

					if (A <= rot && rot <= B) {
						for (int k = 0; k < j; k++) {
							if (list[k] == rot) {
								continue digits;
							}
						}
						pairs++;
						list[j] = rot;
					}
				}

				//c += pairs * (pairs + 1) / 2;
				c += pairs ;
				// c+=digs;
			}
			out.println("Case #" + t + ": " + c);
		}

		in.close();
		out.close();
	}
}

import java.io.File;
import java.io.PrintWriter;
import java.util.HashMap;
import java.util.Scanner;

public class C
{
	public static void main(String[] args)
	{
		try 
		{
			Scanner reader = new Scanner(new File("c:\\codejam\\Csmall.txt"));
			PrintWriter writer = new PrintWriter(new File("c:\\codejam\\Csmallout"));
			int numCases = Integer.parseInt(reader.next());
			for(int caseNum=0;caseNum<numCases;caseNum++)
			{

				String begin = reader.next();
				String end = reader.next();
				int a = Integer.parseInt(begin);
				int b = Integer.parseInt(end);

				int numLen = begin.length();

				int total = 0;
				for(int current=a;current<=b;current++)
				{
					HashMap<Integer,Integer> candidates = new HashMap<Integer,Integer>();
					new C().getCandidates(current,numLen,candidates);
					for(Integer key : candidates.keySet()) {
						int value = candidates.get(key);
						if(current<value && value<=b)
							total++;
					}
				}
				writer.println("Case #" + (1+caseNum) +": "+total);
			}

			writer.close();

		}

		catch (Exception e) 
		{
			e.printStackTrace();
		}

	}

	public HashMap<Integer,Integer> getCandidates(int current, int length, HashMap<Integer, Integer> candidates) {
		String numStr = String.valueOf(current);
		Integer value;
		for(int loop=1;loop<length;loop++)
		{
			value = Integer.parseInt(numStr.substring(loop)+numStr.substring(0,loop));
			candidates.put(value,value);
		}
		return candidates;
	}
}
