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

public class Solution {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int t = sc.nextInt();

        for (int q = 0; q < t; q++) {
            int n = sc.nextInt();
            int k = sc.nextInt();
            
            int[][] a = new int[3][k + 1];
            a[0][1] = 1;
            a[1][1] = 2;
            int i = 2;
            while (i < n) {
                for (int j = 1; j <= ((i + 2) / 2 < k ? (i + 2) / 2 : k); j++) {
                    if (j == 1) {
                        a[2][j] = i + 1;
                    } else {
                        a[2][j] = (a[1][j] + a[0][j - 1]) % 100003;
                    }
                }
                for (int l = 0; l < 2; l++) {
                    for (int m = 1; m <= ((i + 2) / 2 < k ? (i + 2) / 2 : k); m++) {
                        a[l][m] = a[l + 1][m];
                    }
                }
                i++;
            }
            System.out.println(a[2][k]);
        }
    }
}