import java.util.Scanner;

class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int t=sc.nextInt();
		int casos=1, a, b, n, m, cont;
		while(t!=0){
			a=sc.nextInt();
			b=sc.nextInt();
			if(a>b){
				int aux=a;
				a=b;
				b=aux;
			}
			System.out.printf("Case #%d: ",casos++);
			if(a==b){
				System.out.printf("%d\n",0);
			}else{
				cont=0;
				for(n=a;n<b;n++){					
					for(m=n+1;m<=b;m++){					
						if(isRecycled(n,m)) cont++;
					}
				}
				System.out.printf("%d\n",cont);
			}
			t--;
		}		
	}
	public static boolean isRecycled(int n1, int n2){
		String s1, s2, aux;
		s1 =  String.valueOf( n1 );
		s2 =  String.valueOf( n2 );		
		boolean r = false;		
		for(int i=0;i<s1.length();i++){
			aux="";
			aux=s1.substring(i,s1.length())+s1.substring(0,i);
//			System.out.println(aux);
			if(aux.equals(s2)){
				r=true;
				break;
			}
		}		
		return r;
	}
}

import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.ArrayList;
import java.util.Scanner;

public class C {
	static ArrayList<Integer>[] list;
	static long[] ten;
	static int limit;

	public static void main(String[] args) throws IOException {
		initializeTens();
		initializeList();
		System.out.println("initialized");
		
		Scanner in = new Scanner(new FileReader("input.in"));
		BufferedWriter bw = new BufferedWriter(new FileWriter("output"));

		int T = in.nextInt(), start, end;
		for(int i = 1; i <= T; i++)
		{
			start = in.nextInt(); end = in.nextInt();
			
			int ans = cntPairs(start, end);
			bw.write("Case #" + i + ": " + ans);
			bw.newLine();
		}
		
		bw.close();
		System.out.println("end");
	}

	private static int cntPairs(int start, int end) {
		int cnt = 0;
		boolean[] v = new boolean[end+1];
		for(int i = start; i <= end; i++)
			if(list[i] != null && !v[i])
			{
				v[i] = true;
				for(int k : list[i])
					if((k >= start && k <= end) && !v[k]){
						cnt++;
					}
			}
		return cnt;
	}

	private static void getPairs(int n) {
		ArrayList<Integer> ans = new ArrayList<Integer>();
		ans.add(n);
		int len = getLength(n);

		for (int i = 1; i < len; i++) {
			long num = n * ten[i];
			num = num + n / ten[len - i];
			num = num % ten[len];
			
			int res = (int)num;
			if(res < limit && !ans.contains(res) && len == getLength(res))
				ans.add(res);
		}

		if (ans.size() > 1)
			for (int k : ans)
				list[k] = ans;
	}
	
	public static int getLength(int n){
		return (int) (Math.log10(n) + 1e-6) + 1;
	}
	
	private static void initializeList() {
		int start = 1, end = 2000001;
		limit = end;
		list = new ArrayList[end];
		for (int i = start; i < end; i++)
			if (list[i] == null)
				getPairs(i);
	}

	private static void initializeTens() {
		ten = new long[8];
		ten[1] = 10;
		for (int i = 2; i < ten.length; i++)
			ten[i] = 10 * ten[i - 1];
	}
}
