import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;
import java.util.Set;

public class CopyOfCopyOfMain {

	static int ndigits(int n) {
		return (int) (Math.log10(n) + 1);
	}

	static int rot(int n, int dig) {
		return (int) ((n % 10) * Math.pow(10, dig - 1)) + (int) (n / 10);
	}

	public static void main(String[] args) throws FileNotFoundException {
		String file = "C-large";
		Scanner in = new Scanner(new File(file + ".in"));
		PrintWriter out = new PrintWriter(new File(file + ".out"));

		int T = in.nextInt();
		for (int t = 1; t <= T; t++) {
			int A = in.nextInt();
			int B = in.nextInt();

			int c = 0;
			int[] list = new int[ndigits(B)];
			numbers: for (int i = A; i <= B; i++) {
				int digs = ndigits(i);
				int rot = i;
				int pairs = 0;

				Arrays.fill(list, -1);
				list[0] = i;

				digits: for (int j = 1; j <= digs + 1; j++) {

					rot = rot(rot, digs);
					if(rot < i)
						continue;

					if (A <= rot && rot <= B) {
						for (int k = 0; k < j; k++) {
							if (list[k] == rot) {
								continue digits;
							}
						}
						pairs++;
						list[j] = rot;
					}
				}

				//c += pairs * (pairs + 1) / 2;
				c += pairs ;
				// c+=digs;
			}
			out.println("Case #" + t + ": " + c);
		}

		in.close();
		out.close();
	}
}

import java.io.*;
import java.util.*;
public class newRecycledNumbers
{
    static HashMap<String,String> map;
    static int[] recycleNumber(int a){
        String s = Integer.toString( a );
        int[] arr = new int[s.length()];
        arr[0] = a;
        for ( int i = 1; i < s.length() ; i++)
            arr[i] = (int)( a/Math.pow( 10, i ) ) + (int)(a%Math.pow( 10, i ))*(int)(Math.pow( 10, s.length()-i ));
        return arr;
    }
    static void solve(int a, int b){
        int[] arr;
        int size = map.size();
        for ( int n = a; n < b; n++){
            arr = recycleNumber(n);
            for ( int j = 0; j < arr.length; j++)
                if ( arr[j] > n && arr[j] <= b)
                    map.put( Integer.toString( n ) + ", " + Integer.toString(arr[j]), "" );
        }
        System.out.println(map.size()-size);
    }
    public static void main (String[] args) throws IOException
    {
        BufferedReader reader = new BufferedReader(new FileReader("recycle.in"));
        int T = Integer.parseInt(reader.readLine()), a,b;
        for ( int i = 0; i < T; i++){
            map = new HashMap<String,String>();
            StringTokenizer st= new StringTokenizer(reader.readLine());
            a = Integer.parseInt( st.nextToken() );
            b = Integer.parseInt( st.nextToken() );
            System.out.print("Case #" + (i+1) + ": ");
            solve(a,b);
        }
    }
}