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.*;
public class RecycledNumbers
{
    public void RecycledNumbers()throws IOException
    {        
          FileInputStream fstream = new FileInputStream("C:/Users/m.l/Desktop/C-large.in"); 
          DataInputStream in = new DataInputStream(fstream);
          BufferedReader br = new BufferedReader(new InputStreamReader(in));
          int T=Integer.parseInt(br.readLine());
          String S[]=new String[T];int i,j,k,s,l,p,q,A=0,B=0;String a,temp1;
          for(i=0;i<T;i++)
          { 
              s=0;
              S[i]=br.readLine();l=S[i].length();
              for(j=0;j<l;j++)
              {
                  if(S[i].charAt(j)==' ')
                  {
                      A=Integer.parseInt(S[i].substring(0,j));
                      B=Integer.parseInt(S[i].substring(j+1));
                    }
                }
             for(j=A;j<=B;j++)
             {
                 a=Integer.toString(j);int temp2[]=new int[l];l=a.length();
                 for(k=0;k<l-1;k++)
                 {
                     temp1=a.substring(1)+a.charAt(0);temp2[k]=Integer.parseInt(temp1);
                     a=temp1;
                    }
              for(p=0;p<l;p++)
              {
                  q=0;
                  if(temp2[p]>j&&temp2[p]<=B&&temp2[p]>=A)
                  for(q=p+1;q<l;q++)
                  {
                      if(temp2[q]==temp2[p])
                      break;
                    }
                 if(q==l)
                 s+=1;
                }
            }
             System.out.println("Case #"+(i+1)+": "+s);   
            }
        }
    }