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

/**
 *
 * @author posv
 */

public class Recycle{
	public static void main(String[] args){
		int cs = 0;
		int a,b,n,m;
		int temp1, temp2,total,len;
		double temp;
		total = 0;
		try{
			File file = new File("lines2.txt");
			BufferedReader reader = new BufferedReader(new FileReader(file));
			String line = null;
			while ((line = reader.readLine()) != null){
				String[] tokens = line.split(" ");
				Set<Double> ints = new HashSet<Double>();
				if(cs==0){
					cs++;
					continue;
				} else {
					a = Integer.parseInt(tokens[0]);
					b = Integer.parseInt(tokens[1]);
					len = tokens[0].length();
					if(len == 1){
						System.out.println("Case #" +cs+": " + 0);
					}else{
						for(int i=a;i<=b;i++){
							int k = len;
							int j=10;
							temp1 = i;
							while(j<=(Math.pow(10,len-1))){
								temp2 = (int)(temp1%(j)*(Math.pow(10,k-1))) + (int)(temp1/j);
								if(temp1>= i && temp1 <= b && temp2<=b && temp1 < temp2){
									total++;
									temp = temp1*(Math.pow(10,len)) + temp2;
									ints.add(temp);
								}
								k--;
								j=j*10;
							}
						}
					System.out.println("Case #" +cs+": " + ints.size());
					}
				}
				cs++;
			}
		} catch(Exception ex){
			ex.printStackTrace();
		}
	}
}
