package jp.funnything.competition.util;

import java.math.BigInteger;

/**
 * Utility for BigInteger
 */
public class BI {
    public static BigInteger ZERO = BigInteger.ZERO;
    public static BigInteger ONE = BigInteger.ONE;

    public static BigInteger add( final BigInteger x , final BigInteger y ) {
        return x.add( y );
    }

    public static BigInteger add( final BigInteger x , final long y ) {
        return add( x , v( y ) );
    }

    public static BigInteger add( final long x , final BigInteger y ) {
        return add( v( x ) , y );
    }

    public static int cmp( final BigInteger x , final BigInteger y ) {
        return x.compareTo( y );
    }

    public static int cmp( final BigInteger x , final long y ) {
        return cmp( x , v( y ) );
    }

    public static int cmp( final long x , final BigInteger y ) {
        return cmp( v( x ) , y );
    }

    public static BigInteger div( final BigInteger x , final BigInteger y ) {
        return x.divide( y );
    }

    public static BigInteger div( final BigInteger x , final long y ) {
        return div( x , v( y ) );
    }

    public static BigInteger div( final long x , final BigInteger y ) {
        return div( v( x ) , y );
    }

    public static BigInteger mod( final BigInteger x , final BigInteger y ) {
        return x.mod( y );
    }

    public static BigInteger mod( final BigInteger x , final long y ) {
        return mod( x , v( y ) );
    }

    public static BigInteger mod( final long x , final BigInteger y ) {
        return mod( v( x ) , y );
    }

    public static BigInteger mul( final BigInteger x , final BigInteger y ) {
        return x.multiply( y );
    }

    public static BigInteger mul( final BigInteger x , final long y ) {
        return mul( x , v( y ) );
    }

    public static BigInteger mul( final long x , final BigInteger y ) {
        return mul( v( x ) , y );
    }

    public static BigInteger sub( final BigInteger x , final BigInteger y ) {
        return x.subtract( y );
    }

    public static BigInteger sub( final BigInteger x , final long y ) {
        return sub( x , v( y ) );
    }

    public static BigInteger sub( final long x , final BigInteger y ) {
        return sub( v( x ) , y );
    }

    public static BigInteger v( final long value ) {
        return BigInteger.valueOf( value );
    }
}

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

package codejam;

import java.io.FileNotFoundException;
import java.io.FileReader;
import java.util.ArrayList;
import java.util.*;
import java.util.Scanner;

/**
 *
 * @author Mash
 */
public class Main {
  
  public static void main(String args[]) throws FileNotFoundException {

      Scanner in = new Scanner(new FileReader("C:\\ima\\ans.txt"));
                int T=in.nextInt();
                int A,B;

                String a,b,perm;
                char[] per;

                String filler="0000000";

                for(int i=1;i<=T;i++){
                    int res=0;

                    A=in.nextInt();
                    B=in.nextInt();

                    b=Integer.toString(B);

                    for(int j=A;j<=B;j++){
                        int ans;
                   // Set list= new HashSet<Character[]>();
                     Set<String> list=new HashSet<String>();
                    a=Integer.toString(j);
                    int des=b.length()-a.length();
                    perm=filler.substring(0, des)+j;
                    //System.out.println(perm);
                    //per=perm.toCharArray();
                    //permute(per, 0, b.length());
                    String add;
                    for(int s=0;s<=perm.length();s++){
                        add=perm.substring(s)+perm.substring(0,s);
                        list.add(add);
                    }
                    ans=0;
                    Iterator it=list.iterator();
                    //System.out.println("j is"+j);
                    while(it.hasNext())
                    {
                     String comp=(String) it.next();
                     //System.out.println(comp);
                     int com=Integer.parseInt(comp);
                     if(com>j&&com<=B)ans++;
                      }
                    //System.out.println("answer is"+ans);
                    res+=ans;
                    }
                    System.out.println("Case #"+i+": "+res);
                }
    
  }

}
