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.*;
import java.math.*;
import java.io.*;
public class Main
	{
	public static void main(String args[])	throws IOException
		{
		Scanner c=new Scanner(System.in);
		int T=c.nextInt();
		for(int i=0;i<T;i++) 
			{
			int ans=0;
			int A=c.nextInt();
			int B=c.nextInt();
			for(int num=A;num<=B;num++) 
				{
				boolean valid=false;
				//System.out.println("for "+num);
				String num_s=Integer.toString(num);
				TreeSet<Integer> Tr=new TreeSet<Integer>();
				for(int j=1;j<num_s.length();j++) 
					{
					String left=num_s.substring(0,j);
					String right=num_s.substring(j,num_s.length());
					int got=Integer.parseInt(right.concat(left));
					if(got>num&&got>=A&&got<=B)
						Tr.add(got);
					}
				ans+=Tr.size();
				}
			System.out.println("Case #1: "+ans);
			}
		}
	
	}

//must declare new classes here