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 QR_Csmall {
	public static void main(String[] args) throws Exception{
		// Scanner sc = new Scanner(System.in);
		// PrintWriter pw = new PrintWriter(System.out);
		// Scanner sc = new Scanner(new FileReader("input.in"));
		// PrintWriter pw = new PrintWriter(new FileWriter("output.out"));
		Scanner sc = new Scanner(new FileReader("C-small-attempt0.in"));
		PrintWriter pw = new PrintWriter(new FileWriter("C-small-attempt0.out"));
		
		
		int T;
		int A, B;
		int n, m;
		int ncnt;
		int cnt;
		int[] check = new int[3];
		boolean ok;
		
		T = sc.nextInt();
		
		
		for(int times = 1; times <= T; times++){
			A = sc.nextInt();
			B = sc.nextInt();
			cnt = 0;
			
			
			for(int i = A; i < B; i++){
				n = i;
				m = 0;
				ncnt = 0;
				for(int k = 0; k < check.length; k++){
					check[k] = -1;
				}
				
				while(n > 0){
					n /= 10;
					ncnt++;
				}
				
				for(int j = 1; j < ncnt; j++){
					ok = true;
					m = 0;
					m = (i / (int)Math.pow(10, j)) + ((i % (int)Math.pow(10, j)) * (int)Math.pow(10, ncnt-j));
					if(i < m && m <= B){
						check[j - 1] = m;
						for(int l = 0; l < j - 1; l++){
							if(check[l] == m){
								ok = false;
								break;
							}
						}
						if(ok) cnt++;
						
					}
					
				}
				
			}
			
			
			System.out.print("Case #" + times + ": ");
			System.out.print(cnt);
			System.out.println();
			
			
			pw.print("Case #" + times + ": ");
			pw.print(cnt);
			pw.println();
			
		}
		
		sc.close();
		pw.close();
		
	}
}

