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

public class Solution {

    public static void main(String[] args) {
        /* Enter your code here. Read input from STDIN. Print output to STDOUT. Your class should be named Solution. */
        Scanner input = new Scanner(System.in);
        int T = Integer.parseInt(input.nextLine());
        
        for(int i = 0; i<T; i++){
            String[] params = input.nextLine().split(" ");
            int h = Integer.parseInt(params[0])+1;
            int v = Integer.parseInt(params[1])+1;
            
            int[][] ways = new int[3][v];
            for(int j = 0; j<2; j++){
                for(int k = 0; k<v; k++){
                    if(j == 0){
                        if(k==0)
                            ways[j][k] = 1;
                        else
                            ways[j][k] = 0;
                    }
                    if(j == 1){
                        if(k == 0 || k ==1)
                            ways[j][k] = 1;
                        else
                            ways[j][k] = 0;
                    }
                }
            }
            
            for(int j = 2; j<h; j++){
                for(int k = 0; k<v; k++){
                    if(k == 0)
                        ways[j%3][k] = 1;
                    else
                        ways[j%3][k] = (ways[(j-2)%3][k-1] + ways[(j-1)%3][k])%100003;
                }
            }
            System.out.println(ways[(h-1)%3][v-1]);
        }
    }
}