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 C {

	public static class N
	{
		public static int[] m_num;
		public static int m_first;
		public static int length;
		
		public static void set(int n)
		{
			String s = Integer.toString(n);
			char[] c = s.toCharArray();
			m_num = new int[c.length];
			m_first = 0;
			for(int i = 0; i < c.length; i++)
			{
				m_num[m_num.length - i - 1] = Character.digit(c[i], 10);
			}
			length = m_num.length;
		}
		
		
		public static int nextNum()
		{
			m_first = (m_first + 1) % m_num.length;
			int ret = 0;
			int mult = 1;
			for(int i = 0; i < m_num.length; i++)
			{
				ret += (mult*m_num[(i+m_first)%m_num.length]);
				mult *= 10;
			}
			return ret;
		}
		
	}
	
	
	public static int[] binom = {0, 0, 1, 3, 6, 10, 15, 21, 28, 36, 45, 55, 66, 78, 91, 105};
	
	public static void main(String[] args)
	{
	
		Scanner in = new Scanner(System.in);
		
		int T = in.nextInt();
		
		for(int t = 1; t <= T; t++)
		{
			int A = in.nextInt();
			int B = in.nextInt();
			System.out.println("Case #" + t + ": " + foo(A, B));
		}
	}
	
	public static int foo(int lower, int upper)
	{
		if(upper < 10) return 0;
		
		int counter = 0;
		
		boolean[] checked = new boolean[upper - lower + 1];
		
		for(int i = lower; i <= upper; i++)
		{
			if(checked[i-lower]) continue;
			
			N.set(i);
			
			int items = 0;
			
			for(int j = 0; j < N.length; j++)
			{
				int num = N.nextNum();
				
				if(num < lower || num > upper || checked[num-lower]) continue;
				
				checked[num-lower] = true;
				
				items++;
			}
			
			counter += binom[items];
		}
		
		return counter;
	}
}
