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.io.FileWriter;
import java.io.PrintWriter;

public class ProblemC2 
{
	public boolean checked[];
	public int min, max;
	
	public static void main(String [] args)
	{
		new ProblemC2();
	}
	
	public ProblemC2()
	{
		try
		{
			String inputFile = new String("C-large");
			BufferedReader in = new BufferedReader(new FileReader(inputFile));
			PrintWriter	out = new PrintWriter(new FileWriter(inputFile+".out"),true);
				
			int numCases = Integer.parseInt(in.readLine());
			String [] items = null;
			for(int j = 0 ; j < numCases; j++)
			{
				checked = new boolean[2000001];
				items = in.readLine().split("\\s+");
				min = Integer.parseInt(items[0]);
				max = Integer.parseInt(items[1]);
				int total = 0;
				for(int x = min; x <= max; x++)
				{
					if(! checked[x])
						total+=checkRecycled(x);
				}
				out.println("Case #" + (j+1) + ": " + total);
			}
			in.close();
			out.close();
		}
		catch(Exception e)
		{
			e.printStackTrace();
		}
	}

	private int checkRecycled(int x) 
	{
		int matches=1;
		checked[x]=true;
		if(x<10)
			return 0;
		
		int numChecks = 0;
		if(x>=1000000)
			numChecks = 6;
		else if(x>=100000)
			numChecks = 5;
		else if(x>=10000)
			numChecks = 4;
		else if(x>=1000)
			numChecks = 3;
		else if(x>=100)
			numChecks = 2;
		else
			numChecks = 1;
		
		String xstr=new String(""+x);
		int tmp=0;
		for(int i=0; i<numChecks ; i++)
		{
			xstr=xstr.substring(xstr.length()-1)+""+xstr.substring(0,xstr.length()-1);
			if(xstr.startsWith("0"))
				continue;
			tmp = Integer.parseInt(xstr);
			if(x != tmp && tmp >= min && tmp <= max && checked[tmp] == false)
				matches++;
			if(tmp<=2000000)
				checked[tmp]=true;
		}
		if(matches == 1)
			return 0;
		else if(matches == 2)
			return 1;
		else if(matches == 3)
			return 3;
		else if(matches == 4)
			return 6;
		else if(matches == 5)
			return 10;
		else if(matches == 6)
			return 15;
		else if(matches == 7)
			return 21;
		
		return 0;
	}
}
