import bisect
 
# 테스트 케이스 개수 입력
T = int(input())
 
for _ in range(T):
    # N, M 입력
    N, M = map(int, input().split())
 
    # A와 B 크기 리스트 입력
    A = list(map(int, input().split()))
    B = list(map(int, input().split()))
 
    # A 리스트를 오름차순 정렬
    A.sort()
 
    # A가 B보다 큰 쌍의 개수
    count = 0
 
    # 각 B의 크기에 대해 A에서 큰 값을 찾는 방법
    for b in B:
        # bisect_right는 b보다 큰 값이 시작되는 인덱스를 찾음
        idx = bisect.bisect_right(A, b)
        count += len(A) - idx
 
    # 결과 출력
    print(count)

aW1wb3J0IGJpc2VjdAoKIyDthYzsiqTtirgg7LyA7J207IqkIOqwnOyImCDsnoXroKUKVCA9IGludChpbnB1dCgpKQoKZm9yIF8gaW4gcmFuZ2UoVCk6CiAgICAjIE4sIE0g7J6F66ClCiAgICBOLCBNID0gbWFwKGludCwgaW5wdXQoKS5zcGxpdCgpKQogICAgCiAgICAjIEHsmYAgQiDtgazquLAg66as7Iqk7Yq4IOyeheugpQogICAgQSA9IGxpc3QobWFwKGludCwgaW5wdXQoKS5zcGxpdCgpKSkKICAgIEIgPSBsaXN0KG1hcChpbnQsIGlucHV0KCkuc3BsaXQoKSkpCiAgICAKICAgICMgQSDrpqzsiqTtirjrpbwg7Jik66aE7LCo7IicIOygleugrAogICAgQS5zb3J0KCkKICAgIAogICAgIyBB6rCAIELrs7Tri6Qg7YGwIOyMjeydmCDqsJzsiJgKICAgIGNvdW50ID0gMAogICAgCiAgICAjIOqwgSBC7J2YIO2BrOq4sOyXkCDrjIDtlbQgQeyXkOyEnCDtgbAg6rCS7J2EIOywvuuKlCDrsKnrspUKICAgIGZvciBiIGluIEI6CiAgICAgICAgIyBiaXNlY3RfcmlnaHTripQgYuuztOuLpCDtgbAg6rCS7J20IOyLnOyekeuQmOuKlCDsnbjrjbHsiqTrpbwg7LC+7J2MCiAgICAgICAgaWR4ID0gYmlzZWN0LmJpc2VjdF9yaWdodChBLCBiKQogICAgICAgIGNvdW50ICs9IGxlbihBKSAtIGlkeAogICAgCiAgICAjIOqysOqzvCDstpzroKUKICAgIHByaW50KGNvdW50KQ==

Mgo1IDMKOCAxIDcgMyAxCjMgNiAxCjMgNAoyIDEzIDcKMTAzIDExIDI5MCAyMTUK

2
5 3
8 1 7 3 1
3 6 1
3 4
2 13 7
103 11 290 215