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

/**
 *
 * @author Tag
 */

/*
 * Given integers A and B with the same number of digits and no leading zeros, how many distinct recycled pairs (n, m) are there with A â¤ n < m â¤ B?
 * Input
 * The first line of the input gives the number of test cases, T. T test cases follow. Each test case consists of a single line containing the integers A and B.
 * 
 * Output
 * For each test case, output one line containing "Case #x: y", where x is the case number (starting from 1), and y is the number of recycled pairs (n, m) with A â¤ n < m â¤ B.\
 * 
 * Sample
 * Input                Output
 * 4
 * 1 9                     Case #1: 0
 * 10 40                   Case #2: 3
 * 100 500                 Case #3: 156
 * 1111 2222               Case #4: 287
 */


import java.util.Scanner;

public class RecycledNumbers 
{
    public static void main(String args[])
    {
        Scanner input = new Scanner(System.in);
        
        int numTests = new Integer(input.nextLine());
        int recycledPairs;
        
        for(int i = 1; i <= numTests; i++)
        {
            String[] tokens = input.nextLine().split(" ");
            
            Integer smallerNum = new Integer(tokens[0]);
            Integer biggerNum = new Integer(tokens[1]);
            
            recycledPairs = calcRecycled(smallerNum, biggerNum);
            
            System.out.println("Case #" + i + ": " + recycledPairs);
        }
    }

    private static int calcRecycled(Integer smallerNum, Integer biggerNum) 
    {
        int recycledPairs = 0;
        
        while(smallerNum < biggerNum)
        {
            String toCheck = smallerNum.toString();
            
            Integer tmpBigger = new Integer(biggerNum);
            
            while(smallerNum < tmpBigger)
            {
                String biggerStr = tmpBigger.toString();
                
                for(int i = 1; i < biggerStr.length(); i++)
                {
                    if((biggerStr.substring(biggerStr.length() - i) + 
                        biggerStr.substring(0, biggerStr.length() - i)).equals(toCheck))
                    {
                        recycledPairs++;
                    }
                }
                
                tmpBigger--;
            }
            
            smallerNum++;
        }
        
        return recycledPairs;
    }
}
