#include<bits/stdc++.h>
using namespace std ;
typedef long long ll ;
typedef unsigned long long ull ;
typedef pair < int , int > pii ;
typedef vector<int> vi;
#define fi first
#define se second
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()

const int MAXN = 1.2e6 + 7 ;
const int MOD = 998244353 ;

int n ;
int a[ MAXN ] ;

ll fac[ MAXN ] , inv[ MAXN ] ;

ll fastpow ( ll x , ll pw ) {
    ll ret = 1 ;
    while ( pw > 0 ) {
        if ( ( pw % 2 ) == 0 ) {
            x = ( x * x ) % MOD ;
            pw /= 2 ;
        }
        else {
            ret = ( ret * x ) % MOD ;
            -- pw ;
        }
    }
    return ret ;
}

void init ( ) {
    fac[ 0 ] = 1 ;
    for ( int i = 1 ; i < MAXN ; ++ i ) {
        fac[ i ] = ( fac[ i - 1 ] * i ) % MOD ;
    }
    inv[ MAXN - 1 ] = fastpow ( fac[ MAXN - 1 ] , MOD - 2 ) ;
    for ( int i = MAXN - 2 ; i >= 0 ; -- i ) {
        inv[ i ] = ( inv[ i + 1 ] * ( i + 1 ) ) % MOD ;
    }
}

ll comb ( int up , int down ) {
    if ( up < down || down < 0 ) { return 0 ; }
    ll ret = fac[ up ] ;
    ret = ( ret * inv[ down ] ) % MOD ;
    ret = ( ret * inv[ up - down ] ) % MOD ;
    return ret ;
}

ll calc_paths ( int ups , int moves ) {
    ll ret = comb ( moves + ups , ups ) ;
    ret = ( ret + MOD - comb ( moves + ups , ups - 1 ) ) % MOD ;
    return ret ;
}

bool used[ MAXN ] ;

void solve ( ) {
    cin >> n ;
    for ( int i = 1 ; i <= n ; ++ i ) {
        cin >> a[ i ] ;
        used[ i ] = false ;
    }
    int mx = 0 , pos = 1 ;
    ll ans = 0 ;
    for ( int i = 1 ; i <= n ; ++ i ) {
        if ( a[ i ] > mx ) {
            mx = a[ i ] ;
            ans = ( ans + calc_paths ( n - mx - 1 , n - i + 1 ) ) % MOD ;
            used[ a[ i ] ] = true ;
        }
        else {
            ans = ( ans + calc_paths ( n - mx - 1 , n - i + 1 ) ) % MOD ;
            if ( a[ i ] != pos ) { break ; }
            used[ pos ] = true ;
        }
        while ( used[ pos ] == true ) { ++ pos ; }
    }
    cout << ans << "\n" ;
}


int main ( ) {
    ios_base :: sync_with_stdio ( false ) ;
    cin.tie ( NULL ) ;
    init ( ) ;
    int t = 1 ; cin >> t ;
    while ( t -- ) { solve ( ) ; }
    return 0 ;
}