import java.io.FileInputStream;
import java.util.HashMap;
import java.util.Scanner;
import java.util.TreeSet;

// Recycled Numbers
// https://code.google.com/codejam/contest/1460488/dashboard#s=p2

public class C {

	private static String process(Scanner in) {
		int A = in.nextInt();
		int B = in.nextInt();
		int res = 0;
		int len = Integer.toString(A).length();
		for(int n = A; n < B; n++) {
			String str = Integer.toString(n);
			TreeSet<Integer> set = new TreeSet<Integer>();
			for(int i = 1; i < len; i++) {
				int m = Integer.parseInt(str.substring(i, len) + str.substring(0, i));
				if ( m > n && m <= B && ! set.contains(m) ) {
					set.add(m);
					res++;
				}
			}
		}
		return Integer.toString(res);
	}

	public static void main(String[] args) throws Exception {
		Scanner in = new Scanner(System.in.available() > 0 ? System.in : 
			new FileInputStream(Thread.currentThread().getStackTrace()[1].getClassName() + ".practice.in"));
		int T = in.nextInt();
		for(int i = 1; i <= T; i++) 
			System.out.format("Case #%d: %s\n", i, process(in));
	}
}

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

public class ProblemC
{
	public static void main(String[] args)
	{
		String txtfile="C-small-attempt0.in";
		try
		{
			Scanner scan = new Scanner(new FileInputStream(txtfile));
			FileWriter fstream = new FileWriter("C-small-attempt0.out");
			BufferedWriter out = new BufferedWriter(fstream);
			int T = scan.nextInt();
			int y = 0,A,B,l,ban;
			String temp,sban;
			boolean copy;
			int[] z;
			for (int x=1;x<=T;x++)
			{
				A = scan.nextInt();
				B = scan.nextInt();
				y = 0;
				for (int i=A;i<B;i++)
				{
					temp = i + "";
					l = temp.length();
					z = new int[l];
					for (int j=0;j<l;j++) z[j] = 0;
					for (int j=1;j<l;j++)
					{
						sban = temp.substring(j) + "" + temp.substring(0,j);
						ban = Integer.parseInt(sban);
						copy = false;
						z[j] = ban;
						for (int k=0;k<j;k++) if (ban==z[k]) copy = true;
						if (ban>=A && ban<=B && ban>i && copy==false)
						{
							y++;
						}
					}
				}
				out.write("Case #" + x + ": " + y + "\n");
			}
			out.close();
		}
		catch (IOException ex)
		{
			System.out.println(ex);
			System.exit(1);
		}

	}
}