package codejam;

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

public class RecycledNumbers {
	public static void main(String[] args) throws IOException {
		BufferedReader in = new BufferedReader(new FileReader("in.txt"));
		PrintWriter out = new PrintWriter(new File("out.txt"));
		
		int T = Integer.parseInt(in.readLine());
		for (int t = 1; t <= T; ++t) {
			String[] parts = in.readLine().split("[ ]+");
			int A = Integer.parseInt(parts[0]);
			int B = Integer.parseInt(parts[1]);
			
			int cnt = 0;
			for (int i = A; i < B; ++i) {
				String str = String.valueOf(i);
				int n = str.length();
				String res = "";
				Set<Integer> seen = new HashSet<Integer>();
				for (int j = n - 1; j > 0; --j) {
					res = str.substring(j) + str.substring(0, j);
					int k = Integer.parseInt(res);
					if (k > i && k <= B) {
						//System.out.println("(" + i + ", " + k + ")");
						if (!seen.contains(k)) {
							++cnt;
							seen.add(k);
						}
					}
				}
			}

			out.println("Case #" + t + ": " + cnt);
		}
		
		in.close();
		out.close();
		System.exit(0);
	}
}

import java.io.*;
class recycle
{
	public static void main(String args[])throws Exception
	{
		FileReader R=new FileReader("input.txt");
		BufferedReader ds=new BufferedReader(R);
		int n=Integer.parseInt(ds.readLine());
		for(int j=1;j<=n;j++)
		{
			int i;
			String l=ds.readLine();
			for(i=0;i<l.length();i++)
			{
				if(l.charAt(i)==' ')
					break;
			}
			int a=Integer.parseInt(l.substring(0,i));
			int b=Integer.parseInt(l.substring(i+1));
			int p=1,cnt=0;
			String x="",y="";
			for(i=a;i<=b;i++)
			{
				p=1;
				x=Integer.toString(i);
				y=x.substring(p)+x.substring(0,p);
				while(!(x.equals(y)))
				{
					if(Integer.parseInt(y)>Integer.parseInt(x) && Integer.parseInt(y)<=b)
						cnt++;
					p++;
					y=x.substring(p)+x.substring(0,p);
				}
			}
			System.out.println("Case #"+j+": "+cnt);
		}
	}
}