import java.util.*;
import java.lang.*;
import java.math.*;
import java.io.*;

import static java.lang.Math.*;
import static java.util.Arrays.*;
import static java.util.Collections.*;

public class C{
	Scanner sc=new Scanner(System.in);

	int INF=1<<28;
	double EPS=1e-9;

	int caze, T;
	int A, B;

	void run(){
		T=sc.nextInt();
		for(caze=1; caze<=T; caze++){
			A=sc.nextInt();
			B=sc.nextInt();
			solve();
		}
	}

	void solve(){
		int ans=0;
		for(int n=A; n<=B; n++){
			int digit=(int)(log10(n)+EPS);
			int d=(int)pow(10, digit);
			// debug("n", n);
			for(int m=rot(n, d); m!=n; m=rot(m, d)){
				// debug("m", m);
				if(n<m&&m<=B){
					ans++;
				}
			}
		}
		answer(ans+"");
	}

	int rot(int n, int d){
		return n/10+n%10*d;
	}

	void answer(String s){
		println("Case #"+caze+": "+s);
	}

	void println(String s){
		System.out.println(s);
	}

	void print(String s){
		System.out.print(s);
	}

	void debug(Object... os){
		System.err.println(deepToString(os));
	}

	public static void main(String[] args){
		try{
			System.setIn(new FileInputStream("dat/C-small.in"));
			System.setOut(new PrintStream(new FileOutputStream("dat/C-small.out")));
		}catch(Exception e){}
		new C().run();
		System.out.flush();
		System.out.close();
	}
}

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package problem.c.recycled.numbers;

import java.io.File;
import java.io.IOException;
import java.io.PrintStream;
import java.util.Scanner;

/**
 *
 * @author Park
 */
public class ProblemCRecycledNumbers {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) throws IOException {
        PrintStream out = new PrintStream(new File("/Users/Park/Desktop/output.txt"));
        Scanner in = new Scanner(new File("/Users/Park/Desktop/C-small-attempt0.in"));
        int testCase = Integer.parseInt(in.next());
        for (int n = 0; n < testCase; n++) {
            int count = 0;
            //
            int start = Integer.parseInt(in.next());
            int end = Integer.parseInt(in.next());
            //boolean[] chk = new boolean[end - start + 1];
            for (int i = start; i <= end; i++) {
             //   if (!chk[i - start]) {
                    boolean chk=true;
                    String num = i + "";
                    int numLength = num.length();
                    int[] alreadySearch=new int[numLength-1];
                    for (int j = 1; j < numLength; j++) {
                        String f = num.substring(0, j);
                        String b = num.substring(j);
                        int search = Integer.parseInt(b + f);
                        for(int k=0;k<j-1;k++){
                            if(search==alreadySearch[k]){
                                chk=false;
                                break;
                            }
                            chk =true;
                        }
                        alreadySearch[j-1]=search;
                        if (chk&&(search+"").length()==numLength&&search != i && search >= start && search <= end) {
                    //        System.out.println(i+">>"+search);
                            count++;
                    //        chk[search - start] = true;
                        }
                 //   }
                }
            }
            out.println("Case #" + (n + 1) + ": " + count/2);
            System.out.println("Case #" + (n + 1) + ": " + count/2);
        }
        in.close();
        out.close();
    }
}
