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.io.BufferedReader;
import java.io.FileOutputStream;
import java.io.FileReader;
import java.io.OutputStream;
import java.io.PrintStream;
import java.util.HashSet;

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
/**
 *
 * @author bgamlath
 */
public class Main {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) throws Exception {
        // TODO code application logic here
        Integer.parseInt("00001");
        BufferedReader in = new BufferedReader(new FileReader("input.txt"));
        PrintStream out = new PrintStream("output.txt");
        int n = Integer.parseInt(in.readLine());
        for(int i = 1; i<=n; i++){
            out.println("Case #" + i + ": " + getRes(in.readLine()));
        }
    }
    static int getRes(String str){
        String[] m = str.split(" ");
        int a = Integer.parseInt(m[0]);
        int b = Integer.parseInt(m[1]);
        int res = 0;
        for(int i = a; i<=b; i++){
            res += count(i, b);
        }
        return res;
    }

    static int count(int i, int b){
        HashSet<Integer> k = new HashSet<Integer>();
        String s = i + "";
        int len = s.length();
        int t = i;
        for(int  j = 1; j< len; j++){
            k.add(Integer.parseInt((s.substring(j) + s.substring(0,j))));
        }
        int res = 0;
        for(int j: k){
            if((j+"").length()==len && j>i && j<=b)
                res++;
        }
        return res;
        
    }
}
