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.util.*;

class c
{
	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,b;
			a = in.nextInt();
			b = in.nextInt();
			long pairs = 0;
			for(int i=a;i<=b;++i)
			{
				HashSet<Integer> m = new HashSet<Integer>();
				String istr = "" + i;
				int numDigits = istr.length();
				for(int j=1;j<numDigits;++j)
				{
					String backend = istr.substring(j);
					String frontend = istr.substring(0,j);
					String newstr = backend+frontend;
					int newnum = Integer.parseInt(newstr);
					if(newnum > i && newnum <= b)
					{
						if(!m.contains(newnum))
						{
							++pairs;
							m.add(newnum);
						}
					}
				}
			}
			
			System.out.println("Case #"+t+": " + pairs);
		}
	}
}
