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.Arrays;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;

public class rec {

	public static void main(String[] args)
	{
		Scanner sc = new Scanner(System.in);
		int t = sc.nextInt();
		for (int c = 1; c <= t; c++)
		{
			System.out.println("Case #" + c + ": " + solve(sc));
		}
	}

	static void debug(Object... objects)
	{
		System.out.println(Arrays.deepToString(objects));
	}
	
	static final int po[]={1,10,100,1000,10000,100000,1000000,10000000};
	
	public static String solve(Scanner sc)
	{
		int A=sc.nextInt();
		int B=sc.nextInt();
		Set<P> s = new HashSet<P>();
		int N = Integer.toString(A).length();
		for(int i=A;i<=B;i++)
		{
			for(int k=1;k<N;k++)
			{
				int m=i%po[k];
				int p=i/po[k];
				int c = m*po[N-k]+p;
				P np=new P(i,c);
				if(i < c && c <= B && !s.contains(np))
				{
					s.add(np);
				}
			}
		}
		return Integer.toString(s.size());
	}
	
	private static class P
	{
		int v;
		int k;
		public P(int v, int k)
		{
			super();
			this.v = v;
			this.k = k;
		}
		@Override
		public boolean equals(Object obj)
		{
			if(obj == this) return true;
			if(!(obj instanceof P)) return false;
			P p = (P)obj;
			return v == p.v && k == p.k;
		}
		@Override
		public int hashCode()
		{
			int res=17;
			res = res*31 + v;
			res = res*31 + k;
			return res;
		}
	}
}