t = int(input())
while t:
n = int(input())
arr = list(map(int,input().split()))
max = 0
count = 0
for i in arr[::-1]:
if i > max:
max = i
count += 1
print(count-1)
t -= 1
#include<cstdio>
int s,_,n,ans,a[200001],i;
int main(){
scanf("%d",&_);
while(_--){
scanf("%d",&n);s=ans=-1;
for(i=1;i<=n;i++)scanf("%d",&a[i]);
for(i=n;i>=1;i--)if(a[i]>s)s=a[i],ans++;
printf("%d\n",ans);
}
}
810A - Straight A | 1433C - Dominant Piranha |
633A - Ebony and Ivory | 1196A - Three Piles of Candies |
299A - Ksusha and Array | 448B - Suffix Structures |
1092B - Teams Forming | 1166C - A Tale of Two Lands |
544B - Sea and Islands | 152B - Steps |
1174D - Ehab and the Expected XOR Problem | 1511A - Review Site |
1316A - Grade Allocation | 838A - Binary Blocks |
1515D - Phoenix and Socks | 1624D - Palindromes Coloring |
1552F - Telepanting | 1692G - 2Sort |
1191A - Tokitsukaze and Enhancement | 903A - Hungry Student Problem |
52B - Right Triangles | 1712A - Wonderful Permutation |
1712D - Empty Graph | 1712B - Woeful Permutation |
1712C - Sort Zero | 1028B - Unnatural Conditions |
735B - Urbanization | 746C - Tram |
1278B - A and B | 1353D - Constructing the Array |