#include <bits/stdc++.h>
#define endl '\n'
#define F first
#define S second
using namespace std;
#define ll long long
#define pb push_back
#define mod 1000000007
// #define int long long
#define all(x) x.begin(),x.end()
#define allr(x) x.rbegin(),x.rend()
#define CheckBit(x,k) (x & (1LL << k))
#define SetBit(x,k) (x |= (1LL << k))
#define ClearBit(x,k) (x &= ~(1LL << k))
#define LSB(mask) __builtin_ctzll(mask)
#define MSB(mask) 63-__builtin_clzll(mask)
#define print(x) cout << #x << " : " << x << endl
#define error1(x) cerr << #x << " = " << (x) <<endl
#define coutall(v) for(auto &it: v) cout<<it<<' '; cout<<endl
#define Abid_52 ios::sync_with_stdio(false);cin.tie(0),cin.tie(0)
#define error2(a,b) cerr<<"( "<<#a<<" , "<<#b<<" ) = ( "<<(a)<<" , "<<(b)<<" )\n"
#define UNIQUE(x) sort(all(x)), x.erase(unique(all(x)), x.end()), x.shrink_to_fit()
template <typename T, typename U> T ceil(T x, U y) {return (x > 0 ? (x + y - 1) / y : x / y);}
template <typename T, typename U> T floor(T x, U y) {return (x > 0 ? x / y : (x - y + 1) / y);}
const int N = 2e5 + 10;
vector<int>tree[4 * N];
vector<int> v(N + 5);
void build(int node, int st, int en){
if(st == en){
tree[node] = {v[st]};
return;
}
int mid = (st + en) / 2;
int left = 2 * node;
int right = 2 * node + 1;
build(left, st, mid);
build(right, mid + 1, en);
merge(tree[left].begin(), tree[left].end(), tree[right].begin(), tree[right].end(), back_inserter(tree[node]));
}
int query(int node ,int st, int en, int l, int r, int val){
if(st > r || en < l){
return 0;
}
if(l <= st && en <= r){
int id = lower_bound(all(tree[node]), val) - tree[node].begin();
return id;
}
int mid = (st + en) / 2;
int left = 2 * node;
int right = 2 * node + 1;
int q1 = query(left, st, mid, l, r, val);
int q2 = query(right, mid + 1, en, l, r, val);
return q1 + q2;
}
void solve()
{
int n, m;
cin >> n;
for (int i = 1; i <= n; i++)
{
cin >> v[i];
}
build(1, 1, n);
int q;
cin >> q;
while(q--){
int l, x, r;
cin >> l >> x >> r;
ll leftMn = query(1, 1, n, l, x - 1, v[x]);
ll leftMx = (x - l) - query(1, 1, n, l, x - 1, v[x] + 1);
ll rightMn = query(1, 1, n, x + 1, r, v[x]);
ll rightMx = (r - x) - query(1, 1, n, x + 1, r, v[x] + 1);
cout << (leftMn * rightMx) + (leftMx * rightMn) << endl;
}
}
int32_t main()
{
Abid_52;
int t = 1;
cin >> t;
for (int tc = 1; tc <= t; ++tc)
{
// cout << "Case " << tc << ": ";
solve();
}
}