import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {
    static int mod = 100003;
    public static void main(String[] args) {
        Scanner s = new Scanner(System.in);
        int n = s.nextInt();
        for(int i=0;i<n;i++){
        int l=s.nextInt();;
        int k=s.nextInt();
        System.out.println(calculate(k,l));
        }
    }
static long modPow(long a, long x, long p) {
    long res = 1;
    while(x > 0) {
        if( x % 2 != 0) {
            res = (res * a) % p;
        }
        a = (a * a) % p;
        x /= 2;
    }
    return res;
}

static long modInverse(long a, long p) {
    return modPow(a, p-2, p);
}
static long modBinomial(long n, long k, long p) {
	long numerator = 1; 
    for (int i=0; i<k; i++) {
        numerator = (numerator * (n-i) ) % p;
    }
    
    long denominator = 1; 
    for (int i=1; i<=k; i++) {
        denominator = (denominator * i) % p;
    }
    
    return ( numerator* modInverse(denominator,p) ) % p;
}

static public int calculate(int k, int n) {
    return (int)( modBinomial(n-k+1,k, 100003) );
}
}