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.List;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileWriter;
import java.io.IOException;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Map;
import java.util.Scanner;
import java.util.Set;

public class ProblemC {

	/**
	 * @param args
	 */
	public static void main(String[] args) {

		File in = new File(
				"D:/Feng/Workspace/googlecodejam2012/problemC/in/C-small-attempt0.in");

		try {
			BufferedWriter out = new BufferedWriter(new FileWriter(
					"D:/Feng/Workspace/googlecodejam2012/problemC/out/out.txt"));
			StringBuilder s;
			String line = "";
			int min, max = 0;
			int count = 1;
			Scanner scanner = new Scanner(in);
			// Ignore the first line showing total count
			scanner.nextLine();
			while (scanner.hasNextLine()) {
				s = new StringBuilder("Case #");
				s.append(count);
				s.append(": ");
				line = scanner.nextLine();
				String[] limits = line.split(" ");
				min = Integer.parseInt(limits[0]);
				max = Integer.parseInt(limits[1]);
				
				s.append(countRecycledPairs(min, max));

				System.out.println(s);
				out.write(s.toString());
				out.newLine();
				count++;
			}
			scanner.close();
			out.close();
		} catch (FileNotFoundException e) {
			e.printStackTrace();
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}
	}

	public static int countRecycledPairs(int min, int max) {
		
		//List<String> recycledPairs = new ArrayList<String>(1000);
		Set<String> recycledPairs = new HashSet<String>();
		String s = "";
		int m;

		for (int n = min; n < max; n++) {
			// Need at least 2 digits to recycle
			// Cannot have trailing zeroes i.e. n mod 10 = 0
			// Cannot have digits that are all the same

			s = String.valueOf(n);
			for (int numDigitsToReplace = 1; numDigitsToReplace < s.length(); numDigitsToReplace++) {
				// System.out.print(numDigitsToReplace + ", ");
				m = recycle(n, numDigitsToReplace);
				if ((m > n) && (m <= max)) {
					recycledPairs.add(n + ":" + m);
					//count++;
				}

			}

		}
		//System.out.print(recycledPairs.size());
		//System.out.println(recycledPairs.toString());
		return recycledPairs.size();
	}

	public static int recycle(int n, int numDigits) {

		String s = String.valueOf(n);
		StringBuilder sb = new StringBuilder(s);
		String rearDigits = s.substring(s.length() - numDigits);
		sb.delete(sb.length() - numDigits, sb.length());
		sb.insert(0, rearDigits);
		if (sb.toString().startsWith("0")) {
			return 0;
		}
		return Integer.parseInt(sb.toString());

	}

	public static boolean hasSameDigits(int i) {
		String s = String.valueOf(i);
		char[] chars = s.toCharArray();
		char firstDigit = chars[0];
		for (char c : chars) {
			if (c != firstDigit)
				return false;
		}
		return true;
	}
}
