Love Count

Harsh is secretly in love with Sia and wants to impress her. So, for her birthday he buys a permutation $A$ of $n$ elements. Soon he came to know that Sia likes prefix maximums a lot!, so he comes up with a plan. Define $loveCount$ of an array $Z$ with size $m$ as the count of indices $i$ $(1 \leq i \leq m)$ such that $Z_{i}$ is equal to the prefix maximum of $Z$ till index $i$, or formally, $Z_{