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

public class RecycledNumbers {
	public void doMain() throws Exception {
		Scanner sc = new Scanner(new FileReader("input.in"));
		PrintWriter pw = new PrintWriter(new FileWriter("output.txt"));
		int T = sc.nextInt();
		for (int t=0; t<T; t++) {
			System.out.println("Now case " + (t+1));
			int A = sc.nextInt();
			int B = sc.nextInt();
			boolean[] flag = new boolean[B-A+1];
			for(int f=0; f<B-A; f++){
				flag[f] = false;
			}
			int ans = 0;
			for(int i=A; i<B; i++){
				if(flag[i-A]==false){
					String str = String.valueOf(i);
					String curstr = str;
					int NofR = 0;
					int NofRdN = 0;
					for(int j=0; j<str.length()-1;j++){
						String recycled = recycle(str);
						System.out.println(str + " " + recycled);
						int recycledInt = Integer.parseInt(recycled);
						if(recycledInt>Integer.parseInt(curstr) && recycledInt<=B) {
							System.out.println("found!");
							NofRdN++;
							flag[recycledInt-A] = true;
						}
						str = recycled;
					}
					System.out.println("NofRdN = " + NofRdN);
					ans = ans + ((NofRdN+1) * NofRdN)/2;
				}
			}
			System.out.println("Case #" + (t+1) + ": " + ans);
			pw.print("Case #" + (t+1) + ": " + ans);
			pw.println();
		}
		pw.flush();
		pw.close();
		sc.close();
	}

	public static String recycle(String str){
		String last = str.substring(str.length()-1);
		String substr = str.substring(0,str.length()-1);
		String recycled = last + substr;
		return recycled;
	}


	public static void main(String[] args) throws Exception {
		(new RecycledNumbers()).doMain();
	}
}

