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.*;

public class C {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int T = sc.nextInt();
        C th = new C();
        for (int i = 0; i < T; i++) {
            int A = sc.nextInt();
            int B = sc.nextInt();
            int c = th.getAnswer(A, B);
            System.out.println("Case #" + (i+1) + ": " + c);
        }
    }
    public int getAnswer(int A, int B) {
        if (A == B) {
            return 0;
        }
        int count = 0;
        for (int i = A; i < B; i++) {
            String s = "" + i;
            int l = s.length();
            int[] it = new int[l];
            for (int j = 0; j < l; j++) {
                String t = getRotate(s, j+1);
                it[j] = Integer.parseInt(t);
                if (it[j] <= B && it[j] > i) {
                    boolean f = true;
                    for (int k = 0; k < j; k++) {
                        if (it[k] == it[j])
                            f = false;
                    }
                    if (f)
                        count++;
                }
            }
        }
        return count;
    }
    public String getRotate(String s, int r) {
        char[] ch = s.toCharArray();
        int n = ch.length;
        char[] buf = new char[n];
        for (int i = 0; i < r; i++) {
            buf[n-r+i] = ch[i];
        }
        for (int i = 0; i < n-r; i++) {
            buf[i] = ch[r+i];
        }
        return new String(buf);
    }
}

