
import java.util.Scanner;
import java.util.Set;
import java.util.TreeSet;
import java.io.File;
import java.io.IOException;
import java.io.FileWriter;
import java.io.BufferedWriter;

public class Recycle
{
	public static void main(String[] args)
	{
/*		Set<Integer> perms = getPermutations(123456);
		
		for(Integer i: perms)
			System.out.println(i);*/
	
		try
		{
			Scanner s = new Scanner(new File("recycle.in"));
			BufferedWriter w = new BufferedWriter(new FileWriter(new File("recycle.out")));
			int numCases = s.nextInt();
			s.nextLine();
			
			for(int n = 1;n <= numCases; n++)
			{
				int A = s.nextInt();
				int B = s.nextInt();
				int count = 0;
				for(int k = A; k <= B; k++)
				{
					count += getNumPairs(k, B);
				}
				
				w.write("Case #" + n + ": " + count + "\n");
			}
			
			w.flush();
			w.close();
		}
		catch (IOException e)
		{
			e.printStackTrace();
		}
	}
	
	public static int getNumPairs(int n, int B)
	{
		Set<Integer> possibles = getPermutations(n);
		int count = 0;
		for(Integer i : possibles)
			if(i > n && i <= B)
				count++;
		return count;
	}
	
	public static Set<Integer> getPermutations(int n)
	{
		Set<Integer> perms = new TreeSet<Integer>();
		char[] digits = String.valueOf(n).toCharArray();
		
		for(int firstPos = 1; firstPos < digits.length; firstPos++)
		{
			String toBuild = "";
			for(int k = 0; k < digits.length; k++)
				toBuild += digits[(firstPos + k) % digits.length];
			perms.add(Integer.parseInt(toBuild));
		}
		return perms;
	}
	

}

import java.io.BufferedReader;
import java.io.FileInputStream;
import java.io.FileOutputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Map;
import java.util.Set;

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
/**
 *
 * @author nzeyi
 */
public class C {

    public static void main(String[] arg) throws Exception {
        long a = System.currentTimeMillis();
        String in = "/home/nzeyi/Downloads/C-small-attempt0 (1).in";
        String out = "/home/nzeyi/Desktop/out";
        BufferedReader r = new BufferedReader(new InputStreamReader(new FileInputStream(in)));
        PrintWriter w = new PrintWriter(new FileOutputStream(out));
        int c = 0;
        int t = Integer.parseInt(r.readLine());
        String s;
        while ((s = r.readLine()) != null) {
            if (!"".equals(s)) {
                c++;
                w.print("Case #" + c + ": " + r(s));
                if (c < t) {
                    w.println();
                }
            }
        }
        r.close();
        w.flush();
        w.close();
        long b = System.currentTimeMillis();
        System.out.println("Done(MS): " + (b - a));
    }

    public static int r(String line) {
        int ret = 0;
        String[] t = line.trim().split("\\s");
        int a = Integer.parseInt(t[0]);
        int b = Integer.parseInt(t[1]);
        for (int i = a; i <= b; i++) {
            ret += p(i, b);
        }
        return ret;
    }

    public static int p(int n, int b) {
        int ret = 0;
        String ns = "" + n;
        int l = ns.length();
        Set<Integer> set = new HashSet<Integer>();
        for (int i = l - 1; i > 0; i--) {
            int r = Integer.parseInt(ns.substring(i) + ns.substring(0, i));
            if ((r > n) && (r <= b) && !set.contains(r)) {
                ret++;
                set.add(r);
            }
        }
        return ret;
    }
}
