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));
	}
}

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package question3;

/**
 *
 * @author karim
 */
public class Pair {

    private Integer int1;
    private Integer int2;

    public Pair() {
    }

    public Pair(int int1) {
        this.int1 = int1;
    }

    public Pair(int int1, int int2) {
        this.int1 = int1;
        this.int2 = int2;
    }

    public int getint1() {
        return int1;
    }

    public void setint1(int int1) {
        this.int1 = int1;
    }

    public int getint2() {
        return int2;
    }

    public void setint2(int int2) {
        this.int2 = int2;
    }

    @Override
    public boolean equals(Object obj) {
        Pair o = (Pair) obj;
        if ((o.int1.equals(int1) && o.int2.equals(int2)) || (o.int2.equals(int1) && o.int1.equals(
                int2))) {
            return true;
        } else {
            return false;
        }

    }

    @Override
    public int hashCode() {

        return int1.hashCode() + int2.hashCode();
    }
}
