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.util.*;
import java.io.*;

public class Main {

	char []a;
	BufferedReader in;
	StringTokenizer str = null;
	PrintWriter out;
	
	private String next() throws Exception{
		if (str == null || !str.hasMoreElements())
			str = new StringTokenizer(in.readLine());
		return str.nextToken();
	}
	
	private int nextInt() throws Exception{
		return Integer.parseInt(next());
	}
	
	public void run() throws Exception{
		in = new BufferedReader(new FileReader("in.txt"));
		out = new PrintWriter(new File("out.txt"));
		int t = nextInt();
		for(int i=1;i<=t;i++){
			solve(i);
		}
		out.close();
	}
	
	TreeSet<pair> set;
	private void solve(int x) throws Exception{
		int A = nextInt();
		int B = nextInt();
		set = new TreeSet<pair>();

		for(int i=A;i<=B;i++){
			String s = Integer.toString(i);
			for(int j=1;j<s.length();j++){
				if (s.charAt(j) == '0') continue;
				String t = s.substring(j) + s.substring(0, j);
				int k = Integer.parseInt(t);
				if (k == Integer.parseInt(s)) continue;
				if (set.contains(new pair(i, k))) continue;
				if (A <= k && k <= B){ 
					set.add(new pair(k, i));
				}
			}
		}
		out.println("Case #"+x+": " + set.size());
	}
	
	public static void main(String[] args) throws Exception{
		new Main().run();
	}
}
class pair implements Comparable<pair>{
	public int a,b;
	public pair(int a, int b){
		this.a = a;
		this.b = b;
	}
	public int compareTo(pair p){
		if (a > p.a) return 1;
		if (a < p.a) return -1;
		if (b > p.b) return 1;
		if (b < p.b) return -1;
		return 0;
	}
}