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.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.FileReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Scanner;

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

    public static void main(String[] args) throws FileNotFoundException {
        new C().solve();
    }
    
    int[] lastAchivement;
    int calculate(int x, int a, int b)
    {
        String s = Integer.toString(x);
        int res = 0;
        for (int i = 0; i < s.length(); i++)
        {
            int val = Integer.parseInt(s.substring(i).concat(s.substring(0, i)));
            if (val >= a && val <= b && !s.substring(i).concat(s.substring(0, i)).startsWith("0") && val > x && lastAchivement[val] != x)
            {
                res++;
                lastAchivement[val] = x;
              //  out.println(x + " and " + val);
            }
        }
        return res;
    }
    
    PrintWriter out;

    void solve() throws FileNotFoundException {
        Scanner in = new Scanner(new FileReader("src/input.txt"));
        out = new PrintWriter(new FileOutputStream("src/output.txt"));;
        int testCases = in.nextInt();
        for (int t = 1; t <= testCases; t++) {
            int a = in.nextInt();
            int b = in.nextInt();
            lastAchivement = new int[b + 1];
            int res = 0;
            for (int i = a; i <= b; i++)
                res += calculate(i, a, b);
            out.println("Case #" + t + ": " + res);
        }
        in.close();
        out.close();
    }
}
