Merging Two Sorted Lists: Worst-Case Comparisons

Two sorted arrays of lengths $1000$ and $1500$ are merged into one sorted array using the standard two-pointer merge (repeatedly compare the heads of the two arrays and move the smaller one to the output; once one array is exhausted the rest of the other is copied without comparisons).

What is the maximum number of element comparisons this algorithm can perform?