package Main;

import com.sun.deploy.util.ArrayUtil;
import org.apache.commons.lang3.ArrayUtils;

import java.io.*;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.HashSet;

/**
 * Created with IntelliJ IDEA.
 * User: arran
 * Date: 14/04/12
 * Time: 3:12 PM
 * To change this template use File | Settings | File Templates.
 */
public class Round {
    public StringBuilder parse(BufferedReader in) throws IOException {
        StringBuilder out = new StringBuilder();
        String lineCount = in.readLine();

        for (int i = 1; i <= Integer.parseInt(lineCount); i++)
        {
            out.append("Case #"+i+": ");
            System.err.println("Case #"+i+": ");
            String line = in.readLine();
            String[] splits = line.split(" ");
            int p1 = Integer.valueOf(splits[0]);
            int p2 = Integer.valueOf(splits[1]);
            int r = pairRecyclable(p1, p2);
            out.append(r);

//            if (i < Integer.parseInt(lineCount))
                out.append("\n");
        }
        return out;
    }

    public static int pairRecyclable(int i1, int i2) {
        HashSet<String> hash = new HashSet<String>();
        for (int i = i1; i < i2; i++)
        {
            String istr = String.valueOf(i);
            if (istr.length() < 2) continue;
            for (int p = 0; p < istr.length() ; p++)
            {
                String nistr = istr.substring(p,istr.length()).concat(istr.substring(0,p));
                if (Integer.valueOf(nistr) < i1) continue;
                if (Integer.valueOf(nistr) > i2) continue;
                if (nistr.equals(istr)) continue;
                String cnistr = (Integer.valueOf(nistr) > Integer.valueOf(istr)) ?  istr + "," + nistr : nistr + "," + istr;
                hash.add(cnistr);
            }
        }
        return hash.size();
    }

    public static void main(String[] args) {
        InputStreamReader converter = null;
        try {
            int attempt = 0;
            String quest = "C";
//            String size = "small-attempt";
            String size = "large";
            converter = new InputStreamReader(new FileInputStream("src/resource/"+quest+"-"+size+".in"));
            BufferedReader in = new BufferedReader(converter);
            Round r = new Round();
            String str = r.parse(in).toString();
            System.out.print(str);
            FileOutputStream fos = new FileOutputStream(quest+"-"+size+".out");
            OutputStreamWriter osw = new OutputStreamWriter(fos);
            BufferedWriter bw = new BufferedWriter(osw);
            bw.write(str);
            bw.flush();
            bw.close();
        } catch (IOException e) {
            e.printStackTrace();
        }

    }
}

import java.io.BufferedReader;
import java.io.FileReader;
import java.util.Arrays;
import java.util.TreeSet;

public class Main {

	public static void main(String[] args) throws Throwable {
		long init = System.currentTimeMillis();
		int MAX = 2000001;
		//int MAX = 201;
		int arr[][] = new int[MAX][];
		{
			for (int i = 1; i < MAX; i++) {
				TreeSet<Integer> set = new TreeSet<Integer>();
				set.add(i);
				String num = Integer.toString(i);
				for (int j = 1; j < num.length(); j++) {
					String newNum = num.substring(j) + num.substring(0, j);
					if (newNum.charAt(0) != '0') {
						int n = Integer.parseInt(newNum);
						if (n > i && !set.contains(n)) {
							set.add(n);
						}
					}
				}
				set.remove(i);
				arr[i] = new int[set.size()];
				{
					int j = 0;
					for (Integer n : set) arr[i][j++] = n;
				}
			}
		}
		
		long end = System.currentTimeMillis();
		//BufferedReader in = new BufferedReader(new FileReader("C-small-attempt0.in"));
		//BufferedReader in = new BufferedReader(new FileReader("c.in"));
		BufferedReader in = new BufferedReader(new FileReader("C-large.in"));
		
		for (int i = 0, n = Integer.parseInt(in.readLine().trim()); i < n; i++) {
			String s[] = in.readLine().trim().split(" +");
			int a = Integer.parseInt(s[0]), b = Integer.parseInt(s[1]);
			int c = 0;
			for (int j=a; j<=b; j++) {
				for (int k=0, d; k<arr[j].length && (d=arr[j][k]) <= b; k++) c++;
			}
			System.out.println("Case #"+(i+1)+": "+c);
		}
		//System.out.printf("%.2f seconds%n", (end - init) / 1000.);
	}
}
