Yeh vo nhi ho sakta

The story behind this problem is very long and boring. So let us ignore the story for now and dive right into the problem. The problem is as follows: You are given an array $A$ of $N$ positive integers. For each $1 \le i \le N$, find the $max\{A_j|1 \le j \le i\}$. ### Input Format: - The first line of the input contains a single integer $T$ denoting the number of test cases. For each testcase,