Special Arrays

In each test cases, you are given two arrays P and Q, along with an integer k. Arrays will be of equal length (n). You can permute each array within itself so that in permuted version of P and Q, Pi+Qi >= k for each index i. You have to answer 'YES' or 'NO' according to whether such a permutation is possible or not. I/p format: N, followed by N testcases. Each test case is of following format.