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.*;
import java.util.HashMap;

class GoogleRecycle{
	
	public static int[] findNext(String s, int n)
	{
		int a[]= new int[n];
		for (int i =0; i<s.length();i++)
		{
			StringBuilder sb = new StringBuilder();
			sb.append(s.substring(i));
			sb.append(s.substring(0,i));
			Integer temp = Integer.parseInt(sb.toString());
			if(temp.toString().length()==s.length())
				a[i]=Integer.parseInt(sb.toString());
			else 
				a[i]=0;
		}
		return a;
	}

	public static void main(String[] args) throws IOException
	{
		FileReader fr = new FileReader("C-large.in");
		BufferedReader br = new BufferedReader(fr);
		FileWriter fstream = new FileWriter("output.txt");
		BufferedWriter out = new BufferedWriter(fstream);
		
		int testcases = Integer.parseInt(br.readLine());
		
		for (int i=1;i<=testcases;i++)
		{
			
			String line = br.readLine();
			int start = Integer.parseInt(line.substring(0, line.indexOf(' ')));
			int temp =start;
			int n =0;
			while(temp>0)
			{
				temp=temp/10;
				n++;
			}
			line = line.substring(line.indexOf(' ')+1);
			int end = Integer.parseInt(line);
			int count =0;
			for (int j=start;j<=end;j++)
			{
				int[] a =new int[n];
				Integer x = j;
				a= findNext(x.toString(),n);
				HashMap<Integer,String> map = new HashMap<Integer,String>();
				int flag = 0;
				for (int p: a)
				{
					
					if(p>j && p<=end && p!=0 && !map.containsKey(p))
					{
						map.put(p, null);
						count++;
					}
				
				}
				
			}
			//System.out.println("Reached here also");
			out.write("Case #"+i+": "+count);
			if(i!=testcases)
			{
				out.write("\n");
			}
		
		}
		out.close();
		br.close();
	}
}