回忆京都

 二维前缀和有减法，取模时要x=(x%mod+mod)%mod;

#include <iostream>
#include <cstdio>
using namespace std;
inline int read()
{
	int x=0,f=1;
	char c=getchar();
	while(c<'0'&&c>'9')
	{
		if(c=='-')  f=-1;
		c=getchar();
	}
	while(c>='0'&&c<='9')
	{
		x=x*10+c-'0';
		c=getchar();
	}
	return f*x;
}
const int N=1e3+5,mod=19260817;
int c[N][N],s[N][N],q,n,m;
int main()
{
	c[0][0]=1;
	for(int i=1;i<=1000;i++)
	{
		c[i][0]=1;
		for(int j=1;j<=i;j++)
		  c[i][j]=(c[i-1][j-1]+c[i-1][j])%mod;
	}
	for(int i=1;i<=1000;i++)
	  for(int j=1;j<=1000;j++)
	  	s[i][j]=((s[i-1][j]+s[i][j-1]-s[i-1][j-1]+c[i][j])%mod+mod)%mod;
	q=read();
	while(q--)
	{
		n=read();  m=read();
	    cout<<s[m][n]<<"\n";
	}
}