from collections import deque, defaultdict, Counter
from bisect import bisect_left, bisect_right, insort
from itertools import permutations, combinations, groupby
from heapq import heappop, heappush
import math, sys
input = lambda: sys.stdin.readline().rstrip("\r\n")
def printl(li, sep=" "): print(sep.join(map(str, li)))
def yn(flag): print(Yes if flag else No)
_int = lambda x: int(x)-1
MOD = 998244353 #10**9+7
INF = 1<<60
Yes, No = "Yes", "No"

for _ in range(int(input())):
    N, M = map(int, input().split())
    S = list(map(int, input().split()))
    G = list(map(int, input().split()))
    A = [(S[i], G[i]) for i in range(M)]
    A.sort()
    ans = Yes
    for i in range(M-1):
        if A[i][1] > A[i+1][1]:
            ans = No
            break
    print(ans)