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 PYTHON):

Solution:
from __future__ import division, print_function
import bisect
import math
import heapq
import itertools
import sys
from collections import deque
from atexit import register
from collections import Counter
from functools import reduce
sys.setrecursionlimit(100000)
if sys.version_info[0] < 3:
    from io import BytesIO as stream
else:
    from io import StringIO as stream
 
 
if sys.version_info[0] < 3:
    class dict(dict):
        """dict() -> new empty dictionary"""
        def items(self):
            """D.items() -> a set-like object providing a view on D's items"""
            return dict.iteritems(self)
 
        def keys(self):
            """D.keys() -> a set-like object providing a view on D's keys"""
            return dict.iterkeys(self)
 
        def values(self):
            """D.values() -> an object providing a view on D's values"""
            return dict.itervalues(self)
 
    input = raw_input
    range = xrange
 
    filter = itertools.ifilter
    map = itertools.imap
    zip = itertools.izip
 
 
def sync_with_stdio(sync=True):
    """Set whether the standard Python streams are allowed to buffer their I/O.
 
    Args:
        sync (bool, optional): The new synchronization setting.
 
    """
    global input, flush
 
    if sync:
        flush = sys.stdout.flush
    else:
        sys.stdin = stream(sys.stdin.read())
        input = lambda: sys.stdin.readline().rstrip('\r\n')
 
        sys.stdout = stream()
        register(lambda: sys.__stdout__.write(sys.stdout.getvalue()))
        
def main():
    for _ in range(int(input())):
        # n=int(input())
        n,k=map(int,input().split())
        # ar=list(map(int,input().split()))
        a=list(input())
        b=list(input())
        
        d1={}
        d2={}
    
        for i in a:
            try:
                d1[i]+=1
            except:
                d1[i]=1
    
        for i in b:
            try:
                d2[i]+=1
            except:
                d2[i]=1
        # print(d1,d2)
        flag=0
        for i in d1:
            try:
                if d1[i]!=d2[i]:
                    flag=1
                    
                    if d1[i]>d2[i]:
                        d1[i]-=d2[i]
                        d2[i]=0
                    else:
                        d2[i]-=d1[i]
                        d1[i]=0
    
                else:
                    d1[i],d2[i]=0,0
            except:
                flag=1
        # print(d1,d2,flag)      
        
        if flag==0:
            print('Yes')
        else:
            g1=0
            g2=0
            dd1=[]
            dd2=[]
    
            for i in d1:
                g1+=d1[i]//k
                for xxx in range(d1[i]//k):
                    dd1.append(i)
    
            for i in d2:
                g2+=d2[i]//k
                for xxx in range(d2[i]//k):
                    dd2.append(i)
            
            dd1.sort()
            dd2.sort()
            # print(g1,g2,dd1,dd2)
            f2=0
            s1=0
            s2=0
            for i in d1:
                s1+=d1[i]
            for i in d2:
                s2+=d2[i]
    
            if g1==g2 and g1!=0 and g1*k==s1 and g2*k==s2:
                for i in range(len(dd1)):
                    if dd1[i]>dd2[i]:
                        f2=1
                        break
                
                if f2:
                    print('No')
                else:
                    print('Yes')
            else:
                print('No')
            

    
if __name__ == '__main__':
    sync_with_stdio(False)
    main()