#include <iostream>
using namespace std;
const int MOD = 20100403;
const int MAXN = 2e6 + 5;
typedef long long LL;
LL fact[MAXN], inv[MAXN];
// 快速幂计算 x^n % MOD
LL powMod(LL x, LL n) {
LL res = 1;
while (n > 0) {
if (n & 1) res = res * x % MOD;
x = x * x % MOD;
n >>= 1;
}
return res;
}
// 预处理阶乘和逆元
void init(int n) {
fact[0] = 1;
for (int i = 1; i <= n; i++) {
fact[i] = fact[i - 1] * i % MOD;
}
inv[n] = powMod(fact[n], MOD - 2);
for (int i = n - 1; i >= 0; i--) {
inv[i] = inv[i + 1] * (i + 1) % MOD;
}
}
// 计算组合数 C(n, k) % MOD
LL comb(int n, int k) {
if (k < 0 || k > n) return 0;
return fact[n] * inv[k] % MOD * inv[n - k] % MOD;
}
int main() {
int n, m;
cin >> n >> m;
}
