import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileInputStream;
import java.io.FileOutputStream;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;

public class Recycled {
	public static void main(String[] args) throws Exception{
		String inputFile = "C-small-attempt0.in";
		
		BufferedReader input = new BufferedReader(new InputStreamReader(new FileInputStream(inputFile)));
		BufferedWriter output = new BufferedWriter(new OutputStreamWriter(new FileOutputStream("output")));
		long num_cases = Long.parseLong(input.readLine());
		int current_case = 0;
		
		while (current_case < num_cases){
			current_case++;
			
			String[] fields = input.readLine().split(" ");
			int A = Integer.parseInt(fields[0]);
			int B = Integer.parseInt(fields[1]);
			int total = 0;
			
			for (int n = A; n < B; n++){
				for (int m = n+1; m <= B; m++){
					if (isRecycled(n,m)) total++;
				}
			}
			
			System.out.println("Case #" + current_case + ": " + total);
			output.write("Case #" + current_case + ": " + total + "\n");
		}
		output.close();
	}

	private static boolean isRecycled(int n, int m) {
		String sn = ""+n;
		String sm = ""+m;
		if (sn.length() != sm.length()) return false;
		int totaln = 0, totalm = 0;
		for (int i = 0; i < sn.length(); i++){
			totaln += sn.charAt(i);
			totalm += sm.charAt(i);
		}
		if (totaln != totalm) return false;
		for (int i = 0; i < sn.length()-1; i++){
			sm = sm.charAt(sm.length() - 1) + sm.substring(0, sm.length() - 1);
			if (sm.equals(sn)) return true;
		}
		return false;
	}
}

import java.io.BufferedWriter;
import java.io.FileInputStream;
import java.io.FileWriter;
import java.util.Scanner;

public class Main
{
	public static void main(String[] args) throws Exception
	{
		Scanner kb=new Scanner(new FileInputStream(args[0]));
		BufferedWriter bw= new BufferedWriter(new FileWriter(args[1]));
		int T=kb.nextInt();
		for(int i=0;i<T;i++)
		{
			long value=0;
			long x=kb.nextInt();
			long y=kb.nextInt();
			for(long k=x;k<y;k++)
			{
				String s1=new Long(k).toString();
				long lastValue=0;
				long nextValue=0;
				for(int j=1;j<s1.length();j++)
				{ 
					String u=s1.substring(j)+s1.substring(0,j);
					long u1=Long.parseLong(u);
					nextValue=u1;
					if(x<=k && k<u1 && u1<=y)
					{
						if(nextValue!=lastValue)
						{
							value++;
						}
						lastValue=nextValue;											
					}
				}					
			}
			bw.write("Case #"+(i+1)+": "+value);
			bw.newLine();
			bw.flush();
		}
		
 
bw.close();
	}

}
