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.util.Scanner;


public class RecycledNum {

	public static void main(String[] args) {
		
		Scanner sc = new Scanner(System.in);
		int T = sc.nextInt();
		for(int i=0; i<T; i++)
		{
			boolean [] unused = new boolean[10000001];
			int A = sc.nextInt();
			int B = sc.nextInt();
			int numPairs = 0;
			int rot = (int) Math.floor(Math.log10(A));
			int multiplier = (int) Math.pow(10, rot);
			for(int j=A; j<=B; j++)
				unused[j] = true;
			for(int j=A; j<=B; j++)
			{
				if(unused[j])
				{
					unused[j] = false;
					int num = j;
					int numRot = 1;
					for(int k=0; k<rot; k++)
					{
						// rotate
						int part2 = (num%10);
						int part1 = (num/10);
						num = (part2 * multiplier) + part1;
						if(unused[num])
						{
							numRot++;
							unused[num] = false;
						}
					}
					// if numRot >= 2 get numRot C 2
					if(numRot > 1) numPairs += (numRot - 1) * numRot / 2;
				}
			}
			System.out.println("Case #" + (i+1) + ": " + numPairs);

			
		}
	}
}
