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.File;
import java.io.FileNotFoundException;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;

/**
 * 
 */

/**
 * @author alfonzzz
 * 
 */
public class RecycledNumbersSolver {

    /**
     * @param args
     */
    public static void main(String[] args) {
	Scanner in = new Scanner(System.in);
	// Scanner in = getInputScanner();
	int T = in.nextInt();
	for (int i = 1; i <= T; i++) {
	    in.nextLine();
	    int min = in.nextInt();
	    int max = in.nextInt();
	    int result = solve(min, max);
	    System.out.format("Case #%d: %d\n", i, result);
	}
    }

    private static int solve(int min, int max) {
	int result = 0;
	for (int i = min; i <= max; i++) {
	    result += ArrayInt.INSTANCE.setNum(i, min, max);
	}
	result /= 2;
	return result;
    }

    public static enum ArrayInt {

	INSTANCE;

	private char[] backingArray;
	private int orginalNumber;
	private int min;
	private int max;

	private int currentValue;

	private Set<Integer> recycledSet = new HashSet<Integer>();

	public int setNum(int num, int min, int max) {
	    this.orginalNumber = num;
	    this.min = min;
	    this.max = max;
	    backingArray = Integer.toString(num).toCharArray();
	    calculateValue();
	    recycledSet.clear();
	    shiftLeft();
	    int length = length();
	    for (int i = 1; i < length; i++) {
		if (isValid()) {
		    recycledSet.add(value());
		}
		shiftLeft();
	    }

	    return numRecycled();
	}

	private int calculateValue() {
	    currentValue = Integer.parseInt(new String(backingArray));
	    return currentValue;
	}

	public int value() {
	    return currentValue;
	}

	public int length() {
	    return backingArray.length;
	}

	public int numRecycled() {
	    return recycledSet.size();
	}

	public void shiftLeft() {
	    char first = backingArray[0];
	    for (int i = 1; i < backingArray.length; i++) {
		int newPosition = i - 1;
		backingArray[newPosition] = backingArray[i];
	    }
	    backingArray[backingArray.length - 1] = first;
	    calculateValue();
	}

	public boolean isValid() {
	    return !isLeadingZero() && isUnique() && isInRange();
	}

	public boolean isLeadingZero() {
	    return backingArray[0] == '0';
	}

	public boolean isUnique() {
	    if (value() == orginalNumber) {
		return false;
	    }

	    char first = backingArray[0];
	    for (char c : backingArray) {
		if (c != first) {
		    return true;
		}
	    }

	    return false;
	}

	public boolean isInRange() {
	    int value = value();
	    return value >= min && value <= max;
	}

    }

    private static Scanner getInputScanner() {
	Scanner in = null;
	try {
	    in = new Scanner(new File("in.txt"));
	} catch (FileNotFoundException e) {
	    e.printStackTrace();
	}
	return in;
    }

}
