import java.util.Scanner;
import java.io.*;
import java.lang.Math;


public class C{
	public static int recycle(String str){
		String[] numbers = str.split(" ");
		int min = Integer.parseInt(numbers[0]);
		int max = Integer.parseInt(numbers[1]);
		int ret = 0;

		for(int i = min; i < max; i++){
			String num = i + "";
			int len = num.length();
			int k = i;
			for(int j = 1; j < len; j++){
				k = (k/10) + (int)java.lang.Math.pow(10.0,(double)(len-1))*(k%10);
				if (k > i && k <= max)
					ret++;
				else if(k == i)
					break;
			}
		}

		return ret;
	}

	public static void main(String[] args){
		Scanner sc = null;
		String next;
		int out;
		try{
			sc = new Scanner(new File("C-large.in"));
			int cases = Integer.parseInt(sc.nextLine());
			int current = 0;
			

			FileWriter fs = new FileWriter("output.txt");
			BufferedWriter buff = new BufferedWriter(fs);
			while(current < cases){
				next = sc.nextLine();
				current++;
				out = recycle(next);
				buff.write("Case #" + current + ": " + out + "\n");
			}
			buff.close();
		}
		catch(Exception ex){}
	}
}
import java.io.*;
import java.util.*;

public class GoogleQual2012C
{   public static void main(String[] args) throws Throwable
    {   new GoogleQual2012C();
    }
    
    public GoogleQual2012C() throws Throwable
    {   Scanner in = new Scanner(new File("C-large.in"));
        PrintWriter out = new PrintWriter(new FileWriter("C-large.out"));
        int numTests = in.nextInt();
        for (int i = 0; i < numTests; i++)
        {   int a = in.nextInt();
            int b = in.nextInt();
            int total = 0;
            for (int curr = a; curr < b; curr++)
            {   int numDigits = this.numDigits(curr);
                int[] alreadySeen = new int[numDigits - 1];
                for (int numToTake = 1; numToTake < numDigits; numToTake++)
                {   int recycled = this.moveDigits(curr, numToTake);
                    if (recycled > curr && recycled <= b && !this.contains(alreadySeen, recycled))
                    {   total++;
                        alreadySeen[numToTake - 1] = recycled;
                    }
                }
            }
            out.println("Case #" + (i + 1) + ": " + total);
        }
        out.close();
    }
    
    private int numDigits(int n)
    {   int toRet = 1;
        while (n >= 10)
        {   n /= 10;
            toRet++;
        }
        return toRet;
    }
    
    private int moveDigits(int num, int numToTake)
    {   int exp = this.numDigits(num) - numToTake;
        int base = 1;
        for (int i = 0; i < numToTake; i++)
        {   base *= 10;
        }
        int otherBase = 1;
        for (int i = 0; i < exp; i++)
        {   otherBase *= 10;
        }
        return (num / base) + (num % base) * otherBase;
    }
    
    private boolean contains(int[] array, int value)
    {   for (int i = 0; i < array.length; i++)
        {   if (array[i] == value)
            {   return true;
            }
        }
        return false;
    }
}