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.BufferedReader;
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Collections;
import java.util.HashMap;
import java.util.SortedSet;
import java.util.TreeSet;


public final class RecycledNumbers {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		BufferedReader br = null;
		try {
			br = new BufferedReader(new InputStreamReader(new FileInputStream("test.txt")));
			int count = 1;
			String input;
			int cases = Integer.valueOf(br.readLine());
			while (((input = br.readLine()) != null) && (count <= cases)) {
				String output = "Case #"+(count++)+": "+process(input);
				System.out.println(output);				
			}
		} catch (Exception e) {// Catch exception if any
			System.err.println("Error: " + e.getMessage());
		} finally {
			if (br!=null) try { br.close(); } catch(IOException e) {}
		}
	}
	private static final int process(String input) {
		String[] s = input.split(" ");
		if (s[0].length()==1) return 0;
		int A = Integer.valueOf(s[0]);
		int B = Integer.valueOf(s[1]);
		int counter = 0;
		for (int n=A; n<B; n++) {
			SortedSet<Integer> rotates = rotate(n, A, B);
			if (n != rotates.first()) continue;
			counter += count(rotates.size());
		}
		return counter;
	}
	
	private final static int count(int n) {
		if (n < 2) return 0;
		if (n == 2) return 1;
		return --n + count(n);
	}
	
	private static final SortedSet<Integer> rotate(int N, int min, int max) {
		SortedSet<Integer> set = new TreeSet<Integer>();
		set.add(N);
		String sN = Integer.toString(N);
		for (int i = 0; i < sN.length()-1;i++) {
			//if (sN.charAt(1) == '0') continue;
			sN = sN.substring(1)+sN.charAt(0);
			int n = Integer.valueOf(sN);
			if (min<=n && n<=max) set.add(n);
		}
		return set;
	}
}
