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.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.Arrays;

public class C {
	BufferedReader in;
	BufferedWriter out;
	static String inputFile = "C.in";
	static String outputFile = "C.out";

	public Boolean recycled(int n, int m) {
		Boolean result = false;
		String mString = Integer.toString(m);
		String nString = Integer.toString(n);
		String temp;
		int nlen = nString.length();
		int mlen = mString.length();
		for (int a = 0; a < (mlen-nlen); a++) {
			nString = "0" + nString;
		}
		for (int i = 1; i < mlen; i++) {
			temp = switcher(nString,i);
			if (temp.equals(mString)) result = true;
		}
		return result;
	}
	
	public String switcher(String str, int a) {
		int len = str.length();
		StringBuilder builder = new StringBuilder();
		builder.append(str.substring(len-a, len));
		builder.append(str.substring(0,len-a));
		return builder.toString();
	}
	
	public String readWord() throws Exception {
		int c = in.read();
		while (c>=0 && c<=' ') {
			c = in.read();
		}
		if (c < 0) {
			return "";
		}
		StringBuilder builder = new StringBuilder();
		while( c > ' ' ) {
			builder.append((char)c);
			c = in.read();
		}
		return builder.toString();
	}
	
	public void solve() throws Exception {
		int cases = Integer.parseInt(readWord());
		for (int i = 0; i<cases; i++) {
			int A = Integer.parseInt(readWord());
			int B = Integer.parseInt(readWord());
			int count = 0;
			StringBuilder builder = new StringBuilder();
			builder.append("Case #" + (i+1) + ": ");
			for (int m=A; m<=B; m++) {
				for (int n = A; n<m; n++) {
					if (recycled(n,m)) count++;
				}
			}
			builder.append("" + count);
			if (i < cases-1) builder.append("\n");
			out.write(builder.toString());
		}
	}
	
	public static void main(String[] args) {
		C start = new C();
		start.run();

	}
	
	public void run() {
		try {
			in = new BufferedReader(new FileReader(inputFile));
			out = new BufferedWriter(new FileWriter(outputFile));
			solve();
			out.flush();
		} catch (Exception e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}
		
	}

}
