Problem: Ashish has two strings a and b, each of length n, and an integer k. The strings only contain lowercase English letters.

He wants to convert string a into string b by performing some (possibly zero) operations on a.

In one move, he can either 

  * choose an index i (1 ≤ i≤ n-1) and swap a_i and a_{i+1}, or 
  * choose an index i (1 ≤ i ≤ n-k+1) and if a_i, a_{i+1}, …, a_{i+k-1} are all equal to some character c (c ≠ 'z'), replace each one with the next character (c+1), that is, 'a' is replaced by 'b', 'b' is replaced by 'c' and so on. 



Note that he can perform any number of operations, and the operations can only be performed on string a. 

Help Ashish determine if it is possible to convert string a into b after performing some (possibly zero) operations on it.

Input

The first line contains a single integer t (1 ≤ t ≤ 10^5) — the number of test cases. The description of each test case is as follows.

The first line of each test case contains two integers n (2 ≤ n ≤ 10^6) and k (1 ≤ k ≤ n).

The second line of each test case contains the string a of length n consisting of lowercase English letters.

The third line of each test case contains the string b of length n consisting of lowercase English letters.

It is guaranteed that the sum of values n among all test cases does not exceed 10^6.

Output

For each test case, print "Yes" if Ashish can convert a into b after some moves, else print "No".

You may print the letters of the answer in any case (upper or lower).

Example

Input


4
3 3
abc
bcd
4 2
abba
azza
2 1
zz
aa
6 2
aaabba
ddddcc


Output


No
Yes
No
Yes

Note

In the first test case it can be shown that it is impossible to convert a into b.

In the second test case,

"abba" \xrightarrow{inc} "acca" \xrightarrow{inc} … \xrightarrow{inc} "azza".

Here "swap" denotes an operation of the first type, and "inc" denotes an operation of the second type.

In the fourth test case,

"aaabba" \xrightarrow{swap} "aaabab" \xrightarrow{swap} "aaaabb" \xrightarrow{inc} … \xrightarrow{inc} "ddaabb" \xrightarrow{inc} … \xrightarrow{inc} "ddddbb" \xrightarrow{inc} … \xrightarrow{inc} "ddddcc".

Solution (in PYTHON3):

Solution:
from sys import stdin, stdout # only need for big input

def alpha_order(c):
    return ord(c) - ord('a')

def solve():
    n, k = map(int, input().split())
    a = stdin.readline() 
    b = stdin.readline() 
    #a_alpha, b_alpha keep tracks how many time a character appears in a and b
    a_alpha = [0] * 26
    b_alpha = [0] * 26
    for i in range(n):
        a_alpha[alpha_order(a[i])] += 1 
        b_alpha[alpha_order(b[i])] += 1

    #we can only convert alphabet in increasing order
    for c in range(26):
        if a_alpha[c] < b_alpha[c]:
            #we need convert some character in a 
            #operation required to make appearance of alphabet c in a not less than in b
            required = (b_alpha[c] - a_alpha[c] + k - 1 ) // k
            for i in range(c):
                possible = min(a_alpha[i] // k , required)
                a_alpha[i] -= possible * k
                a_alpha[c] += possible * k
                required -= possible
            #if there is no enough operation to perform
            #then it is impossible to make b from a
            if required > 0 :
                print("No")
                return
            #we lock the alphabet that already matches
        a_alpha[c] -= b_alpha[c]

    print("Yes")

def main():
    t = int(input())
    for _ in range(t):
        solve()

if __name__ == "__main__":
    main()