/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

package year_2012.qualification;

import java.io.BufferedReader;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.HashSet;
import java.util.Set;

/**
 *
 * @author paul
 * @date 14 Apr 2012
 */
public class QuestionC {

    private static Set<Integer> getCycle(int x) {

        String s = Integer.toString(x);
        Set<Integer> set = new HashSet<Integer>();
        set.add(x);
        for (int c = 1; c < s.length(); c++) {
            String t = s.substring(c).concat(s.substring(0, c));
            set.add(Integer.parseInt(t));
        }
        return set;
        
    }

    private static Set<Integer> mask(Set<Integer> set, int a, int b) {
        Set<Integer> result = new HashSet<Integer>();

        for (int x : set) {
            if (x >= a && x <= b) {
                result.add(x);
            }
        }
        
        return result;

    }


    public static void main(String[] args) throws FileNotFoundException, IOException {

        String question = "C";

//        String name = "large";
        String name = "small-attempt0";
//        String name = "test";

        String filename = String.format("%s-%s", question, name);

        BufferedReader input = new BufferedReader(
                new FileReader(String.format("/home/paul/Documents/code-jam/2012/qualification/%s.in",
                filename)));

        String firstLine = input.readLine();

        PrintWriter pw = new PrintWriter(new File(
                String.format("/home/paul/Documents/code-jam/2012/qualification/%s.out", filename)));


        int T = Integer.parseInt(firstLine);

        // Loop through test cases.
        for (int i = 0; i < T; i++) {

//             Read data.
            String[] tokens = input.readLine().split(" ");

//            int N = Integer.parseInt(input.readLine());

            int A = Integer.parseInt(tokens[0]);
            int B = Integer.parseInt(tokens[1]);

//            System.out.format("%d, %d\n", A, B);

            boolean[] used = new boolean[B+1];
            int total = 0;
            for (int n = A; n <= B; n++) {
                if (!used[n]) {
                    Set<Integer> set = mask(getCycle(n), A, B);
                    int k = set.size();
                    total += (k * (k-1))/2;
                    for (int m : set) {
                        used[m] = true;
                    }
                }
            }

            pw.format("Case #%d: %d\n", i + 1, total);
        }

        pw.close();

    }

}

import java.io.*;
public class Recycle
{
int t=0,A=0,B=0;
String output="";
int count=1;
public void readFile(String fn)
{
String data="";
try{
File in=new File(fn);
BufferedReader br=new BufferedReader(new InputStreamReader(new FileInputStream(in)));
data=br.readLine();
t=Integer.parseInt(data);
while(count<=t)
{
data=br.readLine();
String s[]=data.split(" ");
A=Integer.parseInt(s[0]);
B=Integer.parseInt(s[1]);
computeRecycle();
count++;
}

br.close();
  }catch(Exception e){}
}

public static void main(String args[])
{
Recycle rc=new Recycle();
rc.readFile(args[0]);
rc.writeToFile();
}

public void computeRecycle()
{

int sum=0;
for(int i=A;i<=B;i++)
{
  String s=""+i;
  String t=s;
  int nm=0;
  int l=s.length();
  do
  {
  char c[]=t.toCharArray();
  char ch=c[0];
  for(int j=0;j<l-1;j++)
  {
   c[j]=c[j+1];   
  }
  c[l-1]=ch;

  t=new String(c);
  nm=Integer.parseInt(t);
   if(nm!=i && nm>=A && nm<=B)
   {
      sum++;
   }
  }while(nm!=i);
  
    
}

sum=sum/2;
output+="Case #"+count+": "+sum+"\n";

}


public void writeToFile(){
    try {
      File fout= new File("output.in");
      DataOutputStream dos = new DataOutputStream(new FileOutputStream(fout));
      dos.writeBytes(output);
      dos.close();
    } catch (Exception ex) {}

  }


}