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.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.PrintWriter;
import java.io.StreamTokenizer;
import java.util.HashSet;


public class Recycled {

	public static void main(String[] args) throws Exception {
		Recycled object = new Recycled();
		object.solve(object.getClass().getSimpleName().toLowerCase());
		}	
	
	public HashSet<Long> hash;
	public int powersOfTen[];

		private void solve(String filePrefix) throws Exception {
			
			StreamTokenizer st = new StreamTokenizer(new BufferedReader(new FileReader(filePrefix + ".in")));
			PrintWriter pw = new PrintWriter(new FileWriter(filePrefix + ".out"));
			
			st.nextToken();
			int testsCount = (int) st.nval;			
			
			for (int tc=0; tc<testsCount; tc++)
			{
				st.nextToken();
				int a = (int) st.nval;
				
				st.nextToken();
				int b = (int) st.nval;
				
				int digits = 0;
				int temp = a;
				
				while (temp > 0)
				{
					temp /= 10;
					digits++;
				}
				
				powersOfTen = new int[digits];
				powersOfTen[0] = 1;
				
				for (int i=1; i<powersOfTen.length; i++)
					powersOfTen[i] = powersOfTen[i-1]*10;
				
				hash = new HashSet<Long>();
				
				for (int n=a; n<b; n++)
				{
					generate(a, b, n, digits);					
				}								
														
				pw.write("Case #" + (tc+1) + ": " + hash.size() + "\n");
			}
			
			pw.flush();
			pw.close();			
		}

		private void generate(int a, int b, int n, int digits) {
			
			for (int take=1; take<digits; take++)
			{
				int first = n / powersOfTen[take];
				int last = n % powersOfTen[take];
				
				int m = last * powersOfTen[digits-take] + first;
				
				if (m <= n)
					continue;
				
				if (m < a || m > b)
					continue;
				
				long encoded = (n+0L) << 30L;
				encoded += m;
				
				if (encoded < 0)
					throw new RuntimeException();
				
				hash.add(encoded);
			}			
		}
}
