#include<bits/stdc++.h>
using namespace std;

#define ll              long long
#define pb              push_back
#define mp              make_pair
#define F               first
#define S               second 
#define all(x)          x.begin(),x.end()
#define rall(x)         x.rbegin(),x.rend()
#define loop(i,m,n)     for(int i=m; i<n; i++)
#define rloop(i,m,n)    for(int i=m; i>=n; i--)
#define print(x)        for(auto t : x){cout << t << " ";}cout <<"\n";
#define printnl(x)      for(auto t : x)cout << t <<"\n";

#define MOD  1e9+7
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);

typedef pair<int,int>   pii; 
typedef vector<int>     vi;   
typedef vector<ll>      vl;  
typedef vector<double>  vd;  
typedef vector<char>    vc;  
typedef vector<string>  vs;  
typedef set<int>        si;  
typedef set<ll>         sl;  
typedef set<double>     sd;  
typedef set<char>       sc;  
typedef set<string>     ss;  
typedef map<int,int>    mi;  
typedef map<ll,int>     ml;  
typedef map<double,int> md;  
typedef map<char,int>   mc;  
typedef map<string,int> ms;  

// **************************************************************************************

void solve(){
    ll n;
    cin>>n;
    ll a[n+1];
    loop(i,1,n+1){
        cin>>a[i];
    }
    loop(i,2,n+1){
        a[i] += a[i-1];
        if(a[i] < i*(i-1)/2){
            cout<<"no\n";
            return;
        }
    } 
    cout<<"yes\n";
    return;
}

int main(){
    fast

    int tc = 1;
    cin>>tc;
    while(tc--){
        solve();
    }

    return 0;
}