#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N=1000005;
ll T,n,a[N],maxn,ans,i;
int main(){
    cin>>T;
    while(T--){ans=0,i=1;
        cin>>n;
        for(int i=1;i<=n;i++) cin>>a[i];
        while(i<=n){
            if(a[i]==i) i++;
            else{
                maxn=a[i];ll j=i+1;
                while(maxn>j){j++;maxn=max(maxn,a[j]);}
                ans+=(j-i+1);i=j+1;
            }
        }cout<<ans<<endl;
    }return 0;
}

#1,2,5,7,8,9 WA

40pts