import sys
from itertools import permutations
from math import ceil

def count_sneaky_visits_modulo(houses, wants_to_visit):
	count = 0
	already_seen = set()
	all_visits = permutations([True] * wants_to_visit + [False] * (houses - wants_to_visit), houses)

	for visit in all_visits:
		if visit not in already_seen:
			already_seen.add(visit)
			
			if is_sneaky(visit, houses):
				count += 1

				if count == 100003:
					count = 0

	return count

def is_sneaky(visit, houses):
	if(visit.count(True) > ceil(houses / 2.0)):
		return False

	for i, value in enumerate(visit[:-1]):
		if value and visit[i+1]:
			return False

	return True

tests = int(sys.stdin.readline())

for _ in range(tests):
	print(count_sneaky_visits_modulo(*map(int, sys.stdin.readline().split())))