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

class Main{

	static BufferedReader br;
	static PrintWriter pw;
	static File in;
	static File out;
	static String name="C-small-attempt0";
	
	
	public static void main(String[] args){
		try{
			in=new File(name+".in");
			out=new File(name+".out");
			br=new BufferedReader(new FileReader(in));
			pw=new PrintWriter(new BufferedWriter(new FileWriter(out)));
			
			int nbCase = Integer.parseInt(br.readLine());
			
			
			for (int n=1;n<=nbCase;n++){
				String line=br.readLine();
				long a=Long.parseLong(line.substring(0,line.indexOf(" ")));
				long b=Long.parseLong(line.substring(line.indexOf(" ")+1));
				long count=0;
				
				for (long n1=a;n1<b;n1++){
					for (long m=n1+1;m<=b;m++){
						if (isRecycled(n1,m)) count++;
					}
				}
				
				pw.println("Case #"+n+": "+count);
			}
			
			
			
			pw.flush();
			pw.close();
			br.close();
		}catch(Exception e){
			e.printStackTrace();
		}
	}
	
	static boolean isRecycled(long n,long m){
		if (n!=m){
			boolean res=false;
			String strM=String.valueOf(m);
			String strN=String.valueOf(n);
			for (int i=1;i<strM.length() && !res;i++){
				String tmp=strN.substring(strN.length()-i,strN.length())+strN.substring(0,strN.length()-i);
				if (tmp.equals(strM)) res=true;
			}
			return res;
		}else return false;
	}
	
	
	
	
}
