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

import java.util.HashSet;

/**
 *
 * @author vandit
 */
public class RecycleNumbers {

    private HashSet<String> numbers = new HashSet<String>();
    private HashSet<String> initialTempNumbers = new HashSet<String>();
    private HashSet<String> finalTempNumbers = new HashSet<String>();

    HashSet<Pair> numberPairs = new HashSet<Pair>();


    private void findRecycledNumbers(int start, int end, int places) {


        for (int i = start; i <= end; i++) {
            String initialNumber = Integer.toString(i);
            //if (!(numbers.contains(initialNumber) || finalTempNumbers.contains(initialNumber))) {

                StringBuffer tempNumber = new StringBuffer(initialNumber);
                int len = tempNumber.length();
                int startIndexToMove = len - places;
                String tempString = tempNumber.substring(startIndexToMove);
                if ((places == 1 && tempString.equals("0")) || tempString.charAt(0) == '0') {
                    continue;
                }
                tempNumber.delete(startIndexToMove, len);
                String finalTempNumber = tempString + tempNumber.toString();

                if (! (finalTempNumber.equals(initialNumber) || Integer.parseInt(finalTempNumber) > end || Integer.parseInt(finalTempNumber) < Integer.parseInt(initialNumber))) {
                    numbers.add(initialNumber);
                    finalTempNumbers.add(finalTempNumber);
                    Pair pair = new Pair(finalTempNumber,initialNumber);
                    numberPairs.add(pair);
                }
            }

        

    }

    public HashSet<Pair> findAllRecycledNumbers(int start, int end) {
        int length = Integer.toString(start).length();
        for (int i = 1; i < length; i++) {
            findRecycledNumbers(start, end, i);
        }
        return numberPairs;
    }
}


/**
 * Shashank Gupta
 * 
 * ****SinnerShanky****
 */
import java.io.*;
public class problem_C
{
    void main()
    {
        try
        {
           FileReader fr=new FileReader("C:\\USERS\\SHASHANK GUPTA\\DOWNLOADS\\C-small-attempt0.in");
           BufferedReader br=new BufferedReader(fr);
           int n=Integer.parseInt(br.readLine());
           for(int i=1;i<=n;i++)
           {
               int count=0;
               String s=br.readLine();
               int b=0;
               int a=0;
               for(int j=0;j<s.length();j++)
                 {
                   if(s.charAt(j)==' ')
                   {
                     a=Integer.parseInt(s.substring(0,j));
                     b=Integer.parseInt(s.substring(j+1,s.length()));
                     j=s.length();
                   }
                  }
                  for(int j=a;j<b;j++)
                  {
                      for(int k=j+1;k<=b;k++)
                      {
                          String temp=Integer.toString(j);
                          if(check(temp,k)==true)
                          count++;
                        }
                  }
                  System.out.println("Case #"+i+": "+count);
           }
            fr.close();
        }
        catch(Exception e)
        {
            System.err.println(e);
        }
    }
    boolean check(String s, int b)
    {
        String s1="";
        for(int i=s.length()-1;i>=0;i--)
        {
            s1=s.substring(0,i);
            s1=s.substring(i)+s1;
            int a=Integer.parseInt(s1);
            if(a==b)
            return true;
        }
        return false;
    }
        
}
