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

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


class Fenwick:
    def __init__(self, n):
        self.a = [0] * (n + 1)

    def sum(self, i):
        s = 0
        while i > 0:
            s += self.a[i]
            i -= i & -i
        return s

    def add(self, i, x):
        while i < len(self.a):
            self.a[i] += x
            i += i & -i


def solve():
    N = rint()
    A = rlist()
    coords = sorted(set(A))
    coords = {x: i for i, x in enumerate(coords, 1)}
    A = [coords[x] for x in A]
    MX = len(coords)

    Q = rint()
    queries = [[q - 1, i] for i, q in enumerate(rlist())]
    queries.sort()

    # lower[qi] = for query (q, qi), how many i < qi and A[i] < A[q] ?
    lower = [0] * Q
    fen = Fenwick(MX)
    i = 0
    for q, qi in queries:
        while i < q:
            fen.add(A[i], 1)
            i += 1
        lower[qi] = fen.sum(A[q])

    higher = [0] * Q
    fen = Fenwick(MX)
    i = 0
    for q, qi in queries:
        while i < q:
            fen.add(MX + 1 - A[i], 1)
            i += 1
        higher[qi] = fen.sum(MX + 1 - A[q])

    lowerR = [0] * Q
    fen = Fenwick(MX)
    i = N - 1
    for q, qi in reversed(queries):
        while i > q:
            fen.add(A[i], 1)
            i -= 1
        lowerR[qi] += fen.sum(A[q])

    higherR = [0] * Q
    fen = Fenwick(MX)
    i = N - 1
    for q, qi in reversed(queries):
        while i > q:
            fen.add(MX + 1 - A[i], 1)
            i -= 1
        higherR[qi] = fen.sum(MX + 1 - A[q])

    for qi in range(Q):
        cur = lower[qi] * higherR[qi]
        cur += higher[qi] * lowerR[qi]
        print(cur)


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()