import java.util.*;
import java.math.BigInteger;
publicclass Main{
publicstaticvoidmain(String[] args){
Scanner input = new Scanner(System.in);
int T;
T = input.nextInt();
int modd = 10000003;
int n, m;
while ((T--) > 0) {
n = input.nextInt();
m = input.nextInt();
BigInteger ans = BigInteger.ONE;
for (int i = m + 1; i <= n; i++) {
ans = ans.multiply(BigInteger.valueOf(i));
}
for (int i = 1; i <= n - m; i++) {
ans = ans.divide(BigInteger.valueOf(i));
}
System.out.println(ans.mod(BigInteger.valueOf(modd)));
}
}
}
// 多组数据:while(input.hasNext())