#include #include #include #include #include #include #include #include #include #define N 1000000 #define ll long long #define MOD 666013 using namespace std; int n, m; ll dp[2][100005]; int main() { cin >> n >> m; if (n < m || m == 1) { cout << 0; return 0; } ll a = 1; for (int i = 3; i <= m; i++) a = a * (i - 1) % MOD; // pun matematicienii dp[1][1] = 1; ll sold = dp[1][m]; for (int i = 2; i <= n; i++) { dp[i % 2][1] = 1; for (int j = 2; j <= min(m, i); j++) dp[i % 2][j] = (dp[!(i % 2)][j] * j + dp[!(i % 2)][j - 1] * j) % MOD; } sold += dp[n % 2][m]; cout << sold * a % MOD; return 0; }