#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long long int lld;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int>pi;
#define makefast ios::sync_with_stdio(false);cin.tie(0)
#define PI (acos(-1)
#define repeat(a,b) for(int variable=a;variable<=b;variable++)
#define loop(n) for(int variable=0;variable<n;variable++)
#define pb push_back
bool isprime(ll n){
    bool prime= true;
    for (ll i=2;i*i<n;i++){
        if(n%i==0){
            prime = false;
            break;
        }
    }
    return prime;
}

int main(){
    makefast;
    int t;
    cin>>t;
    int arr[100];
    while(t--){
        int n;
        long long sum=0,moved = 0;
        cin>>n;
        bool possible=true;
        for(int i=0;i<n;i++){
            cin>>arr[i];
            if(arr[i]>i){
                moved += (arr[i]-i);
            }else{
                if(arr[i]+moved <i){
                    possible = false;
                }
                moved -= (i-arr[i]);
            }
        }

        if(possible)
            cout<<"YES"<<endl;
        else
            cout<<"NO"<<endl;
    }
    return 0;
}

