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.*;
import java.io.*;
import java.math.*;
import static java.lang.System.*;
import static java.lang.Math.*;
import static java.lang.Integer.*;

public class C {
	public static void main(String args[]) throws Exception {
		BufferedReader br = new BufferedReader(new InputStreamReader(in));
		int t = parseInt(br.readLine());
		for(int z=1;z<=t;z++) {
			String[] ss = br.readLine().trim().split("\\s+");
			HashMap<String, Integer> map = new HashMap<String, Integer>();
			int a = parseInt(ss[0]);
			int b = parseInt(ss[1]);
			for(int n=a;n<=b;n++) {
				String s = go(n);
				if(map.containsKey(s)) {
					map.put(s,map.get(s)+1);
				} else {
					map.put(s,1);
				}
			}
			long ans = 0;
			for(int x : map.values()) {
				ans += (long)x*(x-1)/2;
			}
			// out.println(map);
			out.println("Case #"+z+": "+ans);
		}
	}
	
	static int p[] = {0, 1,10,100,1000,10000,100000,1000000,10000000};
	
	static String go(int n) {
		int c = 0;
		int x = n;
		while(x > 0) {
			x /= 10;
			c++;
		}
		int max = 0;
		for(int i=0;i<c;i++) {
			max = max(max,n);
			n = (n/10) + (n%10)*p[c];
		}
		return max+"";
	}
}