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 Problem3
{
    static int size = 4;
    public static void main(String args[])
    {
        try
        {
            FileInputStream fstream = new FileInputStream("C-large.in");
            DataInputStream in = new DataInputStream(fstream);
            BufferedReader br = new BufferedReader(new InputStreamReader(in));
            
            String line;
            int i = 0;
            int num1 = 0, num2 = 0;
            int times;
            Scanner sc;
            int count, total;
            while ((line = br.readLine()) != null)
            {
                if(i == 0)
                {
                    total = Integer.parseInt(line);
                    i = 1;
                    continue;
                }
                sc = new Scanner(line);
                if(sc.hasNextInt()) num1 = sc.nextInt();
                if(sc.hasNextInt()) num2 = sc.nextInt();
                size = (num1==0)?1:(int)Math.log10(num1) + 1;
                times = solve(num1, num2);
                System.out.println("Case #"+i+": "+times);
                write("Case #"+i+": "+times);
                i++;
            }
            in.close();
        }catch (Exception e){
            System.err.println("Error: " + e.getMessage());
        }       
    }
    
    public static int solve(int num1, int num2)
    {
        int i;
        int count = 0;
        int generated;
        for(i = num1; i <= num2; i++)
        {
            for(int j = 1; j < size; j++)
            {
                generated = generate(i, j);
                if(num1 <= i && i < generated && generated <= num2) 
                {
                    count++;
                }
            }
        }
        return count;
    }
    
    public static int generate(int i, int j)
    {
        int temp = i;
        int putfor = temp % (power(10, j));
        int last = temp / (power(10, j));
        int generated = putfor*power(10, size-1-(j-1)) + last;
        return generated;
    }
    
    public static int power(int i, int j)
    {
        int power = 1;
        for(int k = 0; k < j; k++)
        {
            power *= i;
        }
        return power;
    }
    
    public static void write(String text)
    {
        try
        {
            BufferedWriter bw = new BufferedWriter(new FileWriter(new File("Problem3large.out"), true));
            bw.write(text);
            bw.newLine();
            bw.close();
        }catch (Exception e) {
            System.err.println("Error: " + e.getMessage());
        }
    }
}