package codejam;

import java.util.*;
import java.io.*;

public class RecycledNumbers {
	public static void main(String[] args) throws IOException {
		BufferedReader in = new BufferedReader(new FileReader("in.txt"));
		PrintWriter out = new PrintWriter(new File("out.txt"));
		
		int T = Integer.parseInt(in.readLine());
		for (int t = 1; t <= T; ++t) {
			String[] parts = in.readLine().split("[ ]+");
			int A = Integer.parseInt(parts[0]);
			int B = Integer.parseInt(parts[1]);
			
			int cnt = 0;
			for (int i = A; i < B; ++i) {
				String str = String.valueOf(i);
				int n = str.length();
				String res = "";
				Set<Integer> seen = new HashSet<Integer>();
				for (int j = n - 1; j > 0; --j) {
					res = str.substring(j) + str.substring(0, j);
					int k = Integer.parseInt(res);
					if (k > i && k <= B) {
						//System.out.println("(" + i + ", " + k + ")");
						if (!seen.contains(k)) {
							++cnt;
							seen.add(k);
						}
					}
				}
			}

			out.println("Case #" + t + ": " + cnt);
		}
		
		in.close();
		out.close();
		System.exit(0);
	}
}

//input file must be in.txt in this directory
//output file will be out.txt

import java.io.*;
import java.util.*;
public class C
{
	public static Scanner in;
	public static PrintStream out;
	public static void main(String [] args) throws Throwable
	{
		in = new Scanner(new File("in.txt"));
		int cases = in.nextInt();
		in.nextLine();
		out = new PrintStream(new File("out.txt"));
		for (int i = 1; i <= cases; i++)
		{
			out.print("Case #" + i + ": ");
			printResult();
			out.println();
		}
	}
	public static void printResult()
	{
		int a,b;
		a = in.nextInt();
		b = in.nextInt();
		int i = a;
		int firstDigit = 1;
		int numDigits = 0;
		while (i > 0)
		{
			i /= 10;
			firstDigit *= 10;
			numDigits++;
		}
		int [] alreadyDone = new int[numDigits];
		firstDigit /= 10;
		int cur,m;
		int tot = 0;
		boolean notDone;
		for (i = a; i < b; i++)
		{
			cur = i;
			for (int j = 1; j < numDigits; j++)
				alreadyDone[j] = -1;
			for (int j = 1; j < numDigits; j++)
			{
				m = cur % 10;
				cur = (cur / 10) + (m * firstDigit);
				if (cur > i && cur <= b)
				{
					notDone = true;
					for (int k = 1; k < j; k++)
					{
						if (alreadyDone[k] == cur)
						{
							notDone = false;
							break;
						}
					}
					if (notDone)
					{
						alreadyDone[j] = cur;
						tot++;
					}
				}
			}
		}
		out.print(tot);
	}
}
