#!/usr/bin/env python
import os
import sys
from io import BytesIO, IOBase
from collections import defaultdict
from itertools import *
import random
import math
from bisect import *

# MOD = 998244353
MOD = 10**9 + 7

sys.setrecursionlimit(8000000)


def solve():
    N = rint()
    A = rlist()

    class Node:
        def __init__(self, l, r):
            self.l, self.r = l, r
            self.left = self.right = None
            self.a = []
            if l == r:
                self.a = [A[l]]
                return
            mid = l + r >> 1
            self.left = Node(l, mid)
            self.right = Node(mid + 1, r)
            self.a = list(self.left.a)
            self.a.extend(self.right.a)
            self.a.sort()

        def query(self, ql, qr, x, q_less):
            if self.r < ql or self.l > qr:
                return 0

            if ql <= self.l and self.r <= qr:
                if q_less:
                    return bisect_left(self.a, x)
                return len(self.a) - bisect(self.a, x)
            return self.left.query(ql, qr, x, q_less) + self.right.query(
                ql, qr, x, q_less
            )

    tree = Node(0, N - 1)
    for qi in range(rint()):
        L, X, R = rlist()
        L -= 1
        X -= 1
        R -= 1
        val = A[X]
        lowerL = tree.query(L, X - 1, val, 1)
        higherL = tree.query(L, X - 1, val, 0)
        lowerR = tree.query(X + 1, R, val, 1)
        higherR = tree.query(X + 1, R, val, 0)
        print(lowerL * higherR + higherL * lowerR)


def main():
    T = 1
    T = rint()

    for tc in range(1, 1 + T):
        ans = solve()

        # print(ans)
        # print(*ans)

        # print("Yes" if ans else "No")
        # print("YES" if ans else "NO")
        # print("Alice" if ans else "Bob")
        # print("First" if ans else "Second")
        # print("Case #{}: {}".format(tc, ans))
        # print(len(ans))
        # for row in ans: print(*row)


# region fastio

BUFSIZE = 8192


class FastIO(IOBase):
    newlines = 0

    def __init__(self, file):
        self._file = file
        self._fd = file.fileno()
        self.buffer = BytesIO()
        self.writable = "x" in file.mode or "r" not in file.mode
        self.write = self.buffer.write if self.writable else None

    def read(self):
        while True:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            if not b:
                break
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines = 0
        return self.buffer.read()

    def readline(self):
        while self.newlines == 0:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            self.newlines = b.count(b"\n") + (not b)
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines -= 1
        return self.buffer.readline()

    def flush(self):
        if self.writable:
            os.write(self._fd, self.buffer.getvalue())
            self.buffer.truncate(0), self.buffer.seek(0)


class IOWrapper(IOBase):
    def __init__(self, file):
        self.buffer = FastIO(file)
        self.flush = self.buffer.flush
        self.writable = self.buffer.writable
        self.write = lambda s: self.buffer.write(s.encode("ascii"))
        self.read = lambda: self.buffer.read().decode("ascii")
        self.readline = lambda: self.buffer.readline().decode("ascii")


sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")
rint = lambda: int(input())


def rlist():
    return list(map(int, input().split()))


def rgrid(n):
    return [rlist() for _ in range(n)]


# endregion

if __name__ == "__main__":
    main()