import java.io.*;
import java.math.BigInteger;
import java.util.*;

import org.jfree.data.function.PowerFunction2D;

public class r2a
{

	Map numMap = new HashMap();
    int output = 0;

    /**
     * @param args
     */
    public static void main(String[] args)
    {
        r2a mk = new r2a();
        try {
            FileInputStream fstream = new FileInputStream("d:/cjinput.txt");
            DataInputStream in = new DataInputStream(fstream);
            BufferedReader br = new BufferedReader(new InputStreamReader(in));
            String str;
            int i = 0;
            while ((str = br.readLine()) != null) {
            	int begin=0,end = 0;
                i++;
                if (i == 1)
                    continue;
                mk.numMap = new HashMap();
                StringTokenizer strTok = new StringTokenizer(str, " ");
                while (strTok.hasMoreTokens()) {
                	begin =  Integer.parseInt(((String) strTok.nextToken()));
                    end = Integer.parseInt(((String) strTok.nextToken()));
                }

                mk.evaluate(i, begin, end);

            }
            in.close();
        }
        catch (Exception e) {
            System.err.println(e);
        }

    }

    private void evaluate(int rowNum, int begin, int end)
    {
    	output=0;
    	for (int i = begin; i<= end; i++) {
    		if(numMap.containsKey(Integer.valueOf(i)))
    			continue;
    		List l = getPairElems(i);
    		if (l.size() > 0) {
    			Iterator itr = l.iterator();
    			int ctr = 0;
    			ArrayList tempList = new ArrayList();
    			while (itr.hasNext()) {
    				int next = ((Integer)itr.next()).intValue();
    				if (next <= end && next > i) {
    					numMap.put(Integer.valueOf(next), i);
    					tempList.add(next);
    					ctr++;
    				}
    			}
    			ctr = getCounter(ctr+1,2);
/*    			if (tempList.size() > 0 || ctr > 0)
    				System.out.println("DD: " + i + ": " + tempList +" ; ctr = " + ctr);*/
    			output = output + ctr;
    		}
    		
    	}

        String outputStr = "Case #" + (rowNum -1) + ": " + output;
        
        System.out.println(outputStr);
    }

	private int getCounter(int n, int r) {
		int ret = 1;
		int nfactorial =1;
		for (int i = 2; i<=n; i++) {
			nfactorial = i*nfactorial;
		}
		int nrfact =1;
		for (int i = 2; i<=n-r; i++) {
			nrfact = i*nrfact;
		}
		
		return nfactorial/(2*nrfact);
	}

	private ArrayList getPairElems(int num) {
		ArrayList retList = new ArrayList();
		int temp = num;
		if (num/10 == 0)
			return retList;
		
		String str = String.valueOf(num);
		
		int arr[] = new int[str.length()];
		int x = str.length();
		while (temp/10 > 0) {
			arr[x-1] = temp%10;
			temp=temp/10;
			x--;
		}
		arr[0]=temp;
		
		int size = arr.length;
		for (int pos = size -1; pos >0; pos--) {
			if(arr[pos] == 0)
				continue;
			int pairNum = 0;
			int multiplier =1;
			for (int c=0; c < size-1; c++) {
				multiplier = multiplier*10;
			}
			pairNum = pairNum + (arr[pos]*multiplier);
			for(int ctr = pos+1, i=1; i < size; i++,ctr++) {
				if (ctr == size)
					ctr=0;
				if (multiplier!=1)
					multiplier=multiplier/10;
				pairNum = pairNum + (arr[ctr]*multiplier);
			}
			if (pairNum != num)
				retList.add(Integer.valueOf(pairNum));			
		}
		
		return retList;
	}
}

import java.util.*;
import java.io.*;

public class CodeJam {
    public static void main(String[] args) {
        try {
            //recycleLarge(1000000, 2000000);
            // read
            FileInputStream instream = new FileInputStream("A-small.in");
            DataInputStream in = new DataInputStream(instream);
            BufferedReader br = new BufferedReader(new InputStreamReader(in));

            // write
            FileOutputStream outstream = new FileOutputStream("A-small.out");
            DataOutputStream out = new DataOutputStream(outstream);
            BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(out));

            // reading file information
            int testcases = Integer.parseInt(br.readLine());
            for (int i = 0; i < testcases; i++) {
                // -------------------------------------------------------------------------------------------------------------
                String line = br.readLine();
                String[] items = line.split(" ");
                int A = Integer.parseInt(items[0]);
                int B = Integer.parseInt(items[1]);
                // -------------------------------------------------------------------------------------------------------------
                bw.write("Case #" + (i + 1) + ": " + recycleLarge(A, B) + "\r\n");
            }

            // close input file
            in.close();
            // close output file
            bw.flush();
            out.close();
        } catch (Exception e) {
            System.err.println("Error: " + e.getMessage());
        }
    }

    private static int eval(int i) {
        if (i < 0)
            return 0;
        else
            return i;
    }

    private static void printArray(Object[] array) {
        for (Object ch : array)
            System.out.print(ch);
    }

    private static boolean isRecycled(String str, String m) {
        for (int i = 1; i < str.length(); i++) {
            String digits = str.substring(i) + str.substring(0, i);
            if (digits.equals(m)) return true;
        }
        return false;
    }

    private static String convertTo(int n) {
        String str = "";
        while (n != 0) {
            str = (n % 10) + str;
            n = n / 10;
        }
        return str;
    }

    private static long recycle(int A, int B) {
        long count = 0;
        for (int n = A; n < B; n++) {
            for (int m = n + 1; m <= B; m++) {
                String nstr = convertTo(n);
                String mstr = convertTo(m);
                if (isRecycled(nstr, mstr))
                    count++;
            }
        }
        return count;
    }

    private static long evaluate(int n, int A, int B) {
        String nstr = convertTo(n);
        int c = 0;
        for (int i = 1; i < nstr.length(); i++) {
            String digits = nstr.substring(i) + nstr.substring(0, i);
            int variation = Integer.parseInt(digits);
            if(digits.charAt(0) == '0') continue;
            if (digits.equals(nstr)) continue;
            if (variation <= B && variation >= A){
                visit[variation] = true;
                c++;
            }

        }
        return sum(c);
    }

    private static long sum(int n){
        return n * (n+1) / 2;
    }

    private static long recycleLarge(int A, int B) {
        long sum = 0;
        visit = new boolean[B+1];
        for(int i=0; i<B; i++) visit[i] = false;
        for (int n = A; n <= B; n++) {
            if (visit[n] == false)
                sum += evaluate(n, A, B);
        }
        return sum;
    }

    private static boolean[] visit = null;


}

