import java.io.FileInputStream;
import java.util.HashMap;
import java.util.Scanner;
import java.util.TreeSet;

// Recycled Numbers
// https://code.google.com/codejam/contest/1460488/dashboard#s=p2

public class C {

	private static String process(Scanner in) {
		int A = in.nextInt();
		int B = in.nextInt();
		int res = 0;
		int len = Integer.toString(A).length();
		for(int n = A; n < B; n++) {
			String str = Integer.toString(n);
			TreeSet<Integer> set = new TreeSet<Integer>();
			for(int i = 1; i < len; i++) {
				int m = Integer.parseInt(str.substring(i, len) + str.substring(0, i));
				if ( m > n && m <= B && ! set.contains(m) ) {
					set.add(m);
					res++;
				}
			}
		}
		return Integer.toString(res);
	}

	public static void main(String[] args) throws Exception {
		Scanner in = new Scanner(System.in.available() > 0 ? System.in : 
			new FileInputStream(Thread.currentThread().getStackTrace()[1].getClassName() + ".practice.in"));
		int T = in.nextInt();
		for(int i = 1; i <= T; i++) 
			System.out.format("Case #%d: %s\n", i, process(in));
	}
}

import java.util.Scanner;

public class Recycler {

    private Scanner input;

    private int numTests = 0;

    public static void main(String[] args) {
	Scanner inp = new Scanner(System.in);
	int numChar = 0;
	numChar = inp.nextInt();
	Recycler r = new Recycler(inp, numChar);
	r.recycle();
    }

    public Recycler(Scanner inp, int numChar) {
	this.input = inp;
	this.numTests = numChar;
    }

    public void recycle() {
	for (int i = 1; (i <= numTests) && input.hasNextLine(); i += 1) {
	    int base = input.nextInt();
	    int end = input.nextInt();
	    int cycles = this.countCycles(base, end);
	    System.out.println("Case #" + i + ": " + cycles);
	}
    }

    public int countCycles(int start, int end) {
	int total = 0;
	int order = order(start);
	for (int i = start; i < end; i += 1) {
	    for (int j = i + 1; j <= end; j += 1) {
		if (isRecycled(i, j, order)) {
		    total += 1;
		}
	    }
	}
	return total;
    }

    public static boolean isRecycled(int i, int j, int order) {
	int rot = (j / 10) + (order * (j - (10 * (j / 10))));
	while (rot != j) {
	    if (rot == i) {
		return true;
	    }
	    rot = (rot / 10) + (order * (rot - (10 * (rot / 10))));
	}
	return false;
    }

    public static int order(int i) {
	int order = 0;
	while (i > 0) {
	    i /= 10;
	    order += 1;
	}
	int result = 1;
	for (int j = 1; j < order; j += 1) {
	    result *= 10;
	}
	return result;
    }
}
	    
	