import fileinput;
import math;

def computeNumOfWays(houses, gfs):
   emptyHouses = houses - gfs;
   if emptyHouses < gfs:
      return 0; 
   denom = int(math.factorial(gfs))*int(math.factorial(emptyHouses+1-gfs));
   num = int(math.factorial(emptyHouses+1));
   #print(repr(denom) + " " + repr(num));
   dividend = num//denom;
   
   return dividend % 100003;

numOfTests = int(input());
gfs = [];
houses = [];

for i in range(0, numOfTests):
   line = input();
   nums = line.split();
   houses.append(int(nums[0]));
   gfs.append(int(nums[1]));
   
for i in range(0, numOfTests):
   print(computeNumOfWays(houses[i], gfs[i]));