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 int front;

    public static int rotate(int in)
    {
	return (in / 10) + front*(in % 10);
    }

    public static void main(String[] args)
    {
	Scanner in = new Scanner(System.in);

	int T = in.nextInt();

	for(int c = 1; c <= T; c++){
	    int ans = 0;

	    int A = in.nextInt();
	    int B = in.nextInt();

	    int ndig = ("" + A).length();
	    front = 1;
	    for(int i = 1; i < ndig; i++)
		front *= 10;
	    
	    for(int num = A; num <= B; num++){
		int count = 1;
		int rot = rotate(num);
		boolean smallest=true;
		while(smallest &&  rot!= num){
		    if(A <= rot && rot <= B)
			if(rot < num)
			    smallest = false;
			else
			    count++;
		    rot = rotate(rot);
		}
		if(smallest)
		    ans += count*(count - 1)/2;
	    }	

	    System.out.println("Case #" + c + ": " + ans);
	}



    }


}