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

import java.io.*;
/**
 *
 * @author Vincent
 */
public class GoogleJam2012QRC {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
       try{
            //Prepare the reader
            BufferedReader in = new BufferedReader( new FileReader("inputFile.txt"));
            BufferedWriter out = new BufferedWriter(new FileWriter("outputFile.txt"));
            
            //Get the amount of cases to be solved
            String str = in.readLine();
            int caseCount = Integer.parseInt(str);
            
            //For each test case
            for(int i = 0; i < caseCount; i++){
                //Get the line of the problem
                str = in.readLine();
                
                String[] problemData = str.split(" ");
                
                int lowerBound = Integer.parseInt(problemData[0]);
                int upperBound = Integer.parseInt(problemData[1]);
                int recycledCount = 0;
                
                for(int x = lowerBound; x <= upperBound; x++){
                    for(int y = x+1; y <= upperBound; y++){
                        String sx = ""+x;
                        String sy = ""+y;
                        if(sx.length() == sy.length()){
                            boolean matchFound = false;
                            for(int j = 1; j < sx.length() && !matchFound; j++){
                                String temp = sy;
                                sy = temp.substring(1) + temp.charAt(0);
                                if(sx.compareTo(sy) == 0){
                                    recycledCount++;
                                    matchFound = true;
                                }
                            }
                        }
                    }
                }
                
                out.write("Case #" + (i+1) + ": ");
                out.write("" + recycledCount);
                
                out.newLine();
            }
            in.close();
            out.close();
        }
        catch (Exception e){
            System.out.println("Read Failed");
        }
    }
}
