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

public class RecycledNumbers {
  
  public static void main(String... args) throws IOException {
//    BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
    BufferedReader reader = new BufferedReader(new FileReader("C-small-attempt0.in"));
//    PrintWriter writer = new PrintWriter(System.out);
    PrintWriter writer = new PrintWriter("C-small-attempt0.out");

    int len, cases = Integer.parseInt(reader.readLine());

    Set<Integer> unique = new HashSet<Integer>();
    String [] inputs;
    int A, B, k, mod, div, num;
    long res;
    for(int i = 1; i <= cases; i++){
      inputs = reader.readLine().split(" ");
      A = Integer.parseInt(inputs[0]);
      B = Integer.parseInt(inputs[1]);
      res = 0l;
      for(int j = A; j <= B; j++){
        unique.clear();
        k = j;
        int start = 10;
        while(k / start > 0){
          mod = k % start;
          if(mod >= (start / 10)){
            div = k / start;
            num = Integer.parseInt(mod + "" + div);
            if(num > j && num <= B){
              unique.add(num);
            }
          }
          start *= 10;
        }
        res += unique.size();
      }
      System.out.println("Case " + i + " complete");
      writer.println("Case #" + i + ": " + res);
    }

    writer.flush();
  }
}
