Problem: Mack gives Daisy two strings S1 and S2-consisting only of characters- 'M' and 'D' , and asks her to convert S1 to S2 in exactly N moves.

In a single move, Daisy has two choices:
Exchange any one 'M' with a 'D', or
Exchange any one 'D' with a 'M'.

You need to help Daisy if it's possible to transform S1 to S2 in exactly N moves. Output "Yes" if possible, else "No".

Input Format:
First line contains T, the number of test cases. T lines follow.
Each line consists of 2 space separated strings S1 and S2, and and the value N.

Output Format:
For each test case, print the answer, either "Yes" or "No"-(Without the quotes).

Constraints:
1 ≤ T ≤ 250
1 ≤ |S1|=|S2| ≤ 50
1 ≤ N ≤ 100

SAMPLE INPUT
3
MMDMDDM DDDDDDD 2
MMDD MMDD 1
MMMMMDMM DDDDDMDD 8

SAMPLE OUTPUT
No
No
Yes

Solution (in PYTHON):

Solution:
n = int(raw_input().strip())

for i in range(0, n):
    s=[]
    s = (raw_input().strip()).split()
    count = 0

    for j in range(0, len(s[0])):
        if s[0][j] != s[1][j]:
            count +=1
        else:
            continue

    #print count
    if count <= int(s[2]) and (int(s[2]) - count)%2 == 0:
        print "Yes"
    else:
        print "No"