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:
def solve(s1, s2, k):
	count = 0
	for i in xrange(len(s2)):
		if s1[i] != s2[i]:
			count += 1
	
	if count > k:
		return False
	if count == k or (k-count) % 2 == 0:
		return True
	return False

T = input()
for i in xrange(T):
	s1, s2, N = raw_input().strip().split(" ")
	N = int(N)
	if solve(s1, s2, N):
		print "Yes"
	else:
		print "No"