package fixjava;

public class StringUtils {

	/** Repeat the given string the requested number of times. */
	public static String repeat(String str, int numTimes) {
		StringBuilder buf = new StringBuilder(Math.max(0, str.length() * numTimes));
		for (int i = 0; i < numTimes; i++)
			buf.append(str);
		return buf.toString();
	}

	/**
	 * Pad the left hand side of a field with the given character. Always adds at least one pad character. If the length of str is
	 * greater than numPlaces-1, then the output string will be longer than numPlaces.
	 */
	public static String padLeft(String str, char padChar, int numPlaces) {
		int bufSize = Math.max(numPlaces, str.length() + 1);
		StringBuilder buf = new StringBuilder(Math.max(numPlaces, str.length() + 1));
		buf.append(padChar);
		for (int i = 1, mi = bufSize - str.length(); i < mi; i++)
			buf.append(padChar);
		buf.append(str);
		return buf.toString();
	}

	/**
	 * Pad the right hand side of a field with the given character. Always adds at least one pad character. If the length of str is
	 * greater than numPlaces-1, then the output string will be longer than numPlaces.
	 */
	public static String padRight(String str, char padChar, int numPlaces) {
		int bufSize = Math.max(numPlaces, str.length() + 1);
		StringBuilder buf = new StringBuilder(Math.max(numPlaces, str.length() + 1));
		buf.append(str);
		buf.append(padChar);
		while (buf.length() < bufSize)
			buf.append(padChar);
		return buf.toString();
	}

	/** Intern all strings in an array, skipping null elements. */
	public static String[] intern(String[] arr) {
		for (int i = 0; i < arr.length; i++)
			arr[i] = arr[i].intern();
		return arr;
	}

	/** Intern a string, ignoring null */
	public static String intern(String str) {
		return str == null ? null : str.intern();
	}

}

import java.util.Scanner;
import java.util.List;
import java.util.ArrayList;

public class Recycled{

    private Scanner input;

    private int min = 0;
    private int max = 0;
    
    private ArrayList<ArrayList<Integer>> list;

    public Recycled(){
        input = new Scanner(System.in);
        list = new ArrayList<ArrayList<Integer>>();
    }

    public void run(){
        precompute(2000000);
        int T = input.nextInt();
        for(int i = 1; i<=T; i++){
            int A = input.nextInt();
            int B = input.nextInt();
            System.out.printf("Case #%d: %d\n",i,check(A,B));
        }
    }

    public void precompute(int max){
        list.add(new ArrayList<Integer>());
        for(int i = 1; i <= max; i++){
            list.add(new ArrayList<Integer>());
            String n = String.valueOf(i);
            for(int m = 1; m<n.length(); m++){
                String temp = n.substring(m).concat(n.substring(0,m));
                if(temp.charAt(0) != '0' && !temp.equals(n) && !list.get(i).contains(Integer.valueOf(temp))){
                    list.get(i).add(Integer.valueOf(temp));
                }
            }
        }
    }

    public int check(int A, int B){
        if(A == B)
            return 0;
        int result = 0;
        for(int n = A; n < B; n++){
            for(Integer i: list.get(n)){
                if(i >= n && i <= B){
                    result++;
                }
            }
        }
        return result;
    }

    public static void main(String[] args){
        Recycled object = new Recycled();
        object.run();
    }

}
