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 ProblemC {
    public static void main(String[]args) {
	Scanner f = new Scanner(System.in);
	int T = f.nextInt();
	
	for(int set=0;set<T;set++) {
	    int A = f.nextInt();
	    int B = f.nextInt();
	    
	    int b = B;
	    int leadingMult = 1;
	    while(b >= 10) {
		b /= 10;
		leadingMult*=10;
	    }
	    
	    // System.out.println("leadingMult: "+leadingMult);
	    
	    long pairs = 0;
	    for(int x=A;x<=B;x++) {
		// System.out.println("x: "+x);
		int y = x;
		do {
		    y = y/10 + leadingMult*(y%10);
		    // System.out.println("y: "+y);
		    if(x < y && y <= B) {
			//			System.out.printf("(%d,%d)\n",x,y);
			pairs++;
		    }
		} while(y!=x);
	    }
	    
	    System.out.printf("Case #%d: %d\n",set+1,pairs);
	}
    }
}