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;
	}
}

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
//package javaapplication1;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
import java.util.Arrays;

/**
 *
 * @author kent.wangsawan
 */
public class soal2 {
    public static void main(String [] args) throws IOException{
        BufferedReader input = new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer tok;
        int tc = Integer.parseInt(input.readLine());
        for(int i = 0; i<tc; i++){
            tok = new StringTokenizer(input.readLine());
            int awal = Integer.parseInt(tok.nextToken());
            int akir = Integer.parseInt(tok.nextToken());
            int count = 0;
            for(int j = awal; j<akir; j++){
                int temp = j;
                if(temp<10) continue;
                else if(temp< 100){
                    int a = temp%10;
                    temp = temp/10;
                    temp += a*10;
                    if(temp >= awal && temp <= akir && temp > j) {
                        count++;
                    }
                }
                else if(temp<1000){
                    for(int k = 0; k<2; k++){
                        int a = temp%10;
                        temp = temp/10;
                        temp += a*100;
                        if(temp >= awal && temp <= akir && temp > j) {
                            count++;
                        }
                        else if (temp == j)
                            break;
                    }
                }
                else if(temp < 10000){
                    for(int k = 0; k<3; k++){
                        int a = temp%10;
                        temp = temp/10;
                        temp += a*1000;
                        if(temp >= awal && temp <= akir && temp > j) {
                            count++;
                        }
                        else if (temp == j)
                            break;
                    }
                }
            }
            System.out.println("Case #"+(i+1)+": "+count);
        }
    }
}
