結果

問題 No.3394 Big Binom
コンテスト
ユーザー hitonanode
提出日時 2025-12-01 21:44:34
言語 C++23
(gcc 13.3.0 + boost 1.89.0)
結果
AC  
実行時間 8 ms / 2,000 ms
コード長 36,233 bytes
記録
記録タグの例:
初AC ショートコード 純ショートコード 純主流ショートコード 最速実行時間
コンパイル時間 2,248 ms
コンパイル使用メモリ 229,076 KB
実行使用メモリ 7,848 KB
最終ジャッジ日時 2025-12-14 20:01:25
合計ジャッジ時間 3,180 ms
ジャッジサーバーID
(参考情報)
judge2 / judge3
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 4
other AC * 22
権限があれば一括ダウンロードができます

ソースコード

diff #
raw source code

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <forward_list>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <optional>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using lint = long long;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template <typename T> bool chmax(T &m, const T q) { return m < q ? (m = q, true) : false; }
template <typename T> bool chmin(T &m, const T q) { return m > q ? (m = q, true) : false; }
const std::vector<std::pair<int, int>> grid_dxs{{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
int floor_lg(long long x) { return x <= 0 ? -1 : 63 - __builtin_clzll(x); }
template <class T1, class T2> T1 floor_div(T1 num, T2 den) { return (num > 0 ? num / den : -((-num + den - 1) / den)); }
template <class T1, class T2> std::pair<T1, T2> operator+(const std::pair<T1, T2> &l, const std::pair<T1, T2> &r) { return std::make_pair(l.first + r.first, l.second + r.second); }
template <class T1, class T2> std::pair<T1, T2> operator-(const std::pair<T1, T2> &l, const std::pair<T1, T2> &r) { return std::make_pair(l.first - r.first, l.second - r.second); }
template <class T> std::vector<T> sort_unique(std::vector<T> vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); return vec; }
template <class T> int arglb(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::lower_bound(v.begin(), v.end(), x)); }
template <class T> int argub(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::upper_bound(v.begin(), v.end(), x)); }
template <class IStream, class T> IStream &operator>>(IStream &is, std::vector<T> &vec) { for (auto &v : vec) is >> v; return is; }

template <class OStream, class T> OStream &operator<<(OStream &os, const std::vector<T> &vec);
template <class OStream, class T, size_t sz> OStream &operator<<(OStream &os, const std::array<T, sz> &arr);
template <class OStream, class T, class TH> OStream &operator<<(OStream &os, const std::unordered_set<T, TH> &vec);
template <class OStream, class T, class U> OStream &operator<<(OStream &os, const pair<T, U> &pa);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::deque<T> &vec);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::set<T> &vec);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::multiset<T> &vec);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::unordered_multiset<T> &vec);
template <class OStream, class T, class U> OStream &operator<<(OStream &os, const std::pair<T, U> &pa);
template <class OStream, class TK, class TV> OStream &operator<<(OStream &os, const std::map<TK, TV> &mp);
template <class OStream, class TK, class TV, class TH> OStream &operator<<(OStream &os, const std::unordered_map<TK, TV, TH> &mp);
template <class OStream, class... T> OStream &operator<<(OStream &os, const std::tuple<T...> &tpl);

template <class OStream, class T> OStream &operator<<(OStream &os, const std::vector<T> &vec) { os << '['; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <class OStream, class T, size_t sz> OStream &operator<<(OStream &os, const std::array<T, sz> &arr) { os << '['; for (auto v : arr) os << v << ','; os << ']'; return os; }
template <class... T> std::istream &operator>>(std::istream &is, std::tuple<T...> &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);}, tpl); return is; }
template <class OStream, class... T> OStream &operator<<(OStream &os, const std::tuple<T...> &tpl) { os << '('; std::apply([&os](auto &&... args) { ((os << args << ','), ...);}, tpl); return os << ')'; }
template <class OStream, class T, class TH> OStream &operator<<(OStream &os, const std::unordered_set<T, TH> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::deque<T> &vec) { os << "deq["; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T, class U> OStream &operator<<(OStream &os, const std::pair<T, U> &pa) { return os << '(' << pa.first << ',' << pa.second << ')'; }
template <class OStream, class TK, class TV> OStream &operator<<(OStream &os, const std::map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
template <class OStream, class TK, class TV, class TH> OStream &operator<<(OStream &os, const std::unordered_map<TK, TV, TH> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
#ifdef HITONANODE_LOCAL
const string COLOR_RESET = "\033[0m", BRIGHT_CYAN = "\033[1;36m", NORMAL_FAINT = "\033[0;2m";
#define dbg(x) std::cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << std::endl
#define dbgif(cond, x) ((cond) ? std::cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << std::endl : std::cerr)
#else
#define dbg(x) ((void)0)
#define dbgif(cond, x) ((void)0)
#endif


#include <cassert>
#include <iostream>
#include <set>
#include <vector>

template <int md> struct ModInt {
    static_assert(md > 1);
    using lint = long long;
    constexpr static int mod() { return md; }
    static int get_primitive_root() {
        static int primitive_root = 0;
        if (!primitive_root) {
            primitive_root = [&]() {
                std::set<int> fac;
                int v = md - 1;
                for (lint i = 2; i * i <= v; i++)
                    while (v % i == 0) fac.insert(i), v /= i;
                if (v > 1) fac.insert(v);
                for (int g = 1; g < md; g++) {
                    bool ok = true;
                    for (auto i : fac)
                        if (ModInt(g).pow((md - 1) / i) == 1) {
                            ok = false;
                            break;
                        }
                    if (ok) return g;
                }
                return -1;
            }();
        }
        return primitive_root;
    }
    int val_;
    int val() const noexcept { return val_; }
    constexpr ModInt() : val_(0) {}
    constexpr ModInt &_setval(lint v) { return val_ = (v >= md ? v - md : v), *this; }
    constexpr ModInt(lint v) { _setval(v % md + md); }
    constexpr explicit operator bool() const { return val_ != 0; }
    constexpr ModInt operator+(const ModInt &x) const {
        return ModInt()._setval((lint)val_ + x.val_);
    }
    constexpr ModInt operator-(const ModInt &x) const {
        return ModInt()._setval((lint)val_ - x.val_ + md);
    }
    constexpr ModInt operator*(const ModInt &x) const {
        return ModInt()._setval((lint)val_ * x.val_ % md);
    }
    constexpr ModInt operator/(const ModInt &x) const {
        return ModInt()._setval((lint)val_ * x.inv().val() % md);
    }
    constexpr ModInt operator-() const { return ModInt()._setval(md - val_); }
    constexpr ModInt &operator+=(const ModInt &x) { return *this = *this + x; }
    constexpr ModInt &operator-=(const ModInt &x) { return *this = *this - x; }
    constexpr ModInt &operator*=(const ModInt &x) { return *this = *this * x; }
    constexpr ModInt &operator/=(const ModInt &x) { return *this = *this / x; }
    friend constexpr ModInt operator+(lint a, const ModInt &x) { return ModInt(a) + x; }
    friend constexpr ModInt operator-(lint a, const ModInt &x) { return ModInt(a) - x; }
    friend constexpr ModInt operator*(lint a, const ModInt &x) { return ModInt(a) * x; }
    friend constexpr ModInt operator/(lint a, const ModInt &x) { return ModInt(a) / x; }
    constexpr bool operator==(const ModInt &x) const { return val_ == x.val_; }
    constexpr bool operator!=(const ModInt &x) const { return val_ != x.val_; }
    constexpr bool operator<(const ModInt &x) const {
        return val_ < x.val_;
    } // To use std::map<ModInt, T>
    friend std::istream &operator>>(std::istream &is, ModInt &x) {
        lint t;
        return is >> t, x = ModInt(t), is;
    }
    constexpr friend std::ostream &operator<<(std::ostream &os, const ModInt &x) {
        return os << x.val_;
    }

    constexpr ModInt pow(lint n) const {
        ModInt ans = 1, tmp = *this;
        while (n) {
            if (n & 1) ans *= tmp;
            tmp *= tmp, n >>= 1;
        }
        return ans;
    }

    static constexpr int cache_limit = std::min(md, 1 << 21);
    static std::vector<ModInt> facs, facinvs, invs;

    constexpr static void _precalculation(int N) {
        const int l0 = facs.size();
        if (N > md) N = md;
        if (N <= l0) return;
        facs.resize(N), facinvs.resize(N), invs.resize(N);
        for (int i = l0; i < N; i++) facs[i] = facs[i - 1] * i;
        facinvs[N - 1] = facs.back().pow(md - 2);
        for (int i = N - 2; i >= l0; i--) facinvs[i] = facinvs[i + 1] * (i + 1);
        for (int i = N - 1; i >= l0; i--) invs[i] = facinvs[i] * facs[i - 1];
    }

    constexpr ModInt inv() const {
        if (this->val_ < cache_limit) {
            if (facs.empty()) facs = {1}, facinvs = {1}, invs = {0};
            while (this->val_ >= int(facs.size())) _precalculation(facs.size() * 2);
            return invs[this->val_];
        } else {
            return this->pow(md - 2);
        }
    }

    constexpr static ModInt fac(int n) {
        assert(n >= 0);
        if (n >= md) return ModInt(0);
        while (n >= int(facs.size())) _precalculation(facs.size() * 2);
        return facs[n];
    }

    constexpr static ModInt facinv(int n) {
        assert(n >= 0);
        if (n >= md) return ModInt(0);
        while (n >= int(facs.size())) _precalculation(facs.size() * 2);
        return facinvs[n];
    }

    constexpr static ModInt doublefac(int n) {
        assert(n >= 0);
        if (n >= md) return ModInt(0);
        long long k = (n + 1) / 2;
        return (n & 1) ? ModInt::fac(k * 2) / (ModInt(2).pow(k) * ModInt::fac(k))
                       : ModInt::fac(k) * ModInt(2).pow(k);
    }

    constexpr static ModInt nCr(int n, int r) {
        assert(n >= 0);
        if (r < 0 or n < r) return ModInt(0);
        return ModInt::fac(n) * ModInt::facinv(r) * ModInt::facinv(n - r);
    }

    constexpr static ModInt nPr(int n, int r) {
        assert(n >= 0);
        if (r < 0 or n < r) return ModInt(0);
        return ModInt::fac(n) * ModInt::facinv(n - r);
    }

    static ModInt binom(long long n, long long r) {
        static long long bruteforce_times = 0;

        if (r < 0 or n < r) return ModInt(0);
        if (n <= bruteforce_times or n < (int)facs.size()) return ModInt::nCr(n, r);

        r = std::min(r, n - r);
        assert((int)r == r);

        ModInt ret = ModInt::facinv(r);
        for (int i = 0; i < r; ++i) ret *= n - i;
        bruteforce_times += r;

        return ret;
    }

    // Multinomial coefficient, (k_1 + k_2 + ... + k_m)! / (k_1! k_2! ... k_m!)
    // Complexity: O(sum(ks))
    // Verify: https://yukicoder.me/problems/no/3178
    template <class Vec> static ModInt multinomial(const Vec &ks) {
        ModInt ret{1};
        int sum = 0;
        for (int k : ks) {
            assert(k >= 0);
            ret *= ModInt::facinv(k), sum += k;
        }
        return ret * ModInt::fac(sum);
    }
    template <class... Args> static ModInt multinomial(Args... args) {
        int sum = (0 + ... + args);
        ModInt result = (1 * ... * ModInt::facinv(args));
        return ModInt::fac(sum) * result;
    }

    // Catalan number, C_n = binom(2n, n) / (n + 1) = # of Dyck words of length 2n
    // C_0 = 1, C_1 = 1, C_2 = 2, C_3 = 5, C_4 = 14, ...
    // https://oeis.org/A000108
    // Complexity: O(n)
    static ModInt catalan(int n) {
        if (n < 0) return ModInt(0);
        return ModInt::fac(n * 2) * ModInt::facinv(n + 1) * ModInt::facinv(n);
    }

    ModInt sqrt() const {
        if (val_ == 0) return 0;
        if (md == 2) return val_;
        if (pow((md - 1) / 2) != 1) return 0;
        ModInt b = 1;
        while (b.pow((md - 1) / 2) == 1) b += 1;
        int e = 0, m = md - 1;
        while (m % 2 == 0) m >>= 1, e++;
        ModInt x = pow((m - 1) / 2), y = (*this) * x * x;
        x *= (*this);
        ModInt z = b.pow(m);
        while (y != 1) {
            int j = 0;
            ModInt t = y;
            while (t != 1) j++, t *= t;
            z = z.pow(1LL << (e - j - 1));
            x *= z, z *= z, y *= z;
            e = j;
        }
        return ModInt(std::min(x.val_, md - x.val_));
    }
};
template <int md> std::vector<ModInt<md>> ModInt<md>::facs = {1};
template <int md> std::vector<ModInt<md>> ModInt<md>::facinvs = {1};
template <int md> std::vector<ModInt<md>> ModInt<md>::invs = {0};

using ModInt998244353 = ModInt<998244353>;
// using mint = ModInt<998244353>;
// using mint = ModInt<1000000007>;

#include <cassert>
#include <fstream>
#include <vector>

// 結合法則が成立する要素の列について連続部分列の積を前計算を利用し高速に求める
template <class S, S (*op)(S, S), S (*e)(), S (*getter)(long long), int Bucket>
struct product_embedding {
    std::vector<S> pre_; // pre_[i] = S[i * Bucket] * ... * S[(i + 1) * Bucket - 1]

    product_embedding(std::vector<S> pre) : pre_(pre) {}

    S prod(long long l, long long r) { // S[l] * ... * S[r - 1]
        assert(0 <= l);
        assert(l <= r);
        assert(r <= (long long)Bucket * (long long)pre_.size());

        if (r - l <= Bucket) {
            S ret = e();
            while (l < r) ret = op(ret, getter(l++));
            return ret;
        }

        long long lb = (l + Bucket - 1) / Bucket, rb = r / Bucket;
        S ret = e();
        for (long long i = l; i < lb * Bucket; ++i) ret = op(ret, getter(i));
        for (int i = lb; i < rb; ++i) ret = op(ret, pre_[i]);
        for (long long i = rb * Bucket; i < r; ++i) ret = op(ret, getter(i));
        return ret;
    }

    static void prerun(std::string filename, long long upper_lim) {
        std::ofstream ofs(filename);

        long long cur = 0;
        long long num_bucket = (upper_lim + Bucket - 1) / Bucket;

        ofs << "({";
        while (num_bucket--) {
            S p = e();
            for (int t = 0; t < Bucket; ++t) { p = op(p, getter(cur++)); }
            ofs << p;
            if (num_bucket) ofs << ",";
        }
        ofs << "});";
    }
};
// /* Usage:
using S = int;
constexpr S md = 998244353;
S op(S l, S r) { return (long long)l * r % md; }
S e() { return 1; }
S getter(long long i) { return i + 1 >= md ? (i + 1) % md : i + 1; }
using PE = product_embedding<S, op, e, getter, 500000>;

// int main() {
//     PE::prerun("tmp.txt", md);  // -> copy & paste the content of dumped file
// }
// */

using mint = ModInt998244353;

int main() {
    PE pe({832944090,704684917,615706648,847294252,88352218,907186201,691150420,913840185,615963223,855364605,119871024,260484657,859947701,746803828,757605891,90252390,303168424,458692733,447902118,519044747,337902171,527262360,806954223,278433728,371945574,802657446,33796109,479029221,13074962,263679799,637034850,968665616,191551499,17396452,627009992,772903324,570222470,206900285,819076745,27672112,241549436,692501166,560987504,452030081,798290073,486395423,289596666,373492135,488937237,104582136,702664424,722130811,867669096,953433936,525925834,547831392,810191792,259515457,646462939,87520491,45130800,872439232,854509412,546905493,416913780,370009844,215906029,270663392,633518868,353660403,9557444,137174105,113142527,530062995,558370997,969283332,686746504,389907830,185278447,2425097,216737352,899793077,357571905,270870373,314893045,911840177,444906080,381832665,401470410,692839732,98864994,541679223,616224683,267140709,104124053,511029824,635050637,706453173,285939194,200357740,510478137,185885637,397669445,443607993,554478339,46750669,139176254,538999618,459494109,733260799,617176936,512018697,746780475,667740900,537479303,86146177,662071180,518101865,134794267,754404967,955634140,820294170,889803075,352952586,848590919,563568811,795071441,695639765,262777923,924356134,335545297,709511822,241813913,923488656,693947185,996767921,229966252,669350019,990409291,615776680,665912266,234328009,79764676,457436288,761000715,581509788,882807186,500352747,445576519,424358603,329380611,766526824,392121440,484087487,945403082,661078349,361486608,418779645,2047908,790121293,717319608,181370889,246321649,264130035,593914025,501011429,888792043,726043686,543471483,558121411,25320611,380791470,864178613,322869975,75052465,671375132,934470063,681356552,731820230,540562934,246250337,898548852,501435722,645211462,984306599,603512249,10173564,103142919,483320083,77477420,504125401,871282714,893685842,442026845,172237327,462737473,305280106,236641044,130159734,127411991,450000803,748338626,662543565,468110724,132498639,291021318,545257818,551546108,701726537,313606148,297564719,382416160,67102615,279512928,78638017,448448905,756688280,593997502,312588959,290832776,129707390,624650235,557355897,238261927,121925590,362083384,234875527,425833339,480539233,106030094,172218364,952925093,635704320,635763376,943293808,664757555,535325704,160913233,342146476,610171684,349280028,532241258,647283895,785956119,487557452,875742751,329524131,939160764,470188386,727473676,865816474,153612065,285604631,606994152,96707086,146082330,131276205,694526979,795908785,574669965,68297241,310263879,981026205,682536036,382231137,475872984,295877903,451223167,876264010,708776818,696873077,23468719,6656113,772393476,648660683,452073171,702772465,655566941,660259716,845914532,171812887,170722369,429075375,638795268,129509320,470723034,681826522,61667818,426797734,717004532,416360058,225664875,290024229,918559157,188631059,422932338,759185298,513413011,796306384,267387829,520944657,522529672,489563204,732763088,169165050,917393532,645351691,829660260,34801306,400284161,79943282,940469822,870134687,32915287,179372351,117987380,534980592,472079946,120654283,369256017,12840367,220843777,987347928,531915924,454678057,473647442,908234924,93612215,354346483,244447478,902987399,374480738,391608870,16717414,383590348,562466602,287498834,548484934,223919319,105791239,733705025,653133119,920458406,926100928,541250239,917374201,476441488,876170735,210115868,257550453,88859392,208330688,28766939,559304604,617055733,384236027,920029552,297649547,582781732,162607781,925103418,10535319,494631007,113663680,982682735,28164542,847728321,667610886,341090839,935561939,179913956,177548070,765619720,268917887,747391931,808473081,414391352,396867630,268971031,577589482,844186883,899701547,926976231,742075664,382014807,123049443,78097534,240479098,960060331,597901213,358197202,944743545,794008581,796488938,122198933,532051694,855497454,212107682,550619009,655108052,980800940,322905946,641588402,571533601,240943570,902228965,394730555,880954325,30654933,831081844,365432633,129673244,943766468,243363382,892539880,481048296,299162179,692900032,323398505,996843507,597243714,458077362,191032769,405281429,969138036,931305831,572728483,402096153,376617212,165408216,868339148,748866282,592619490,669915230,613204348,472216681,23106973,308027574,128618720,887545879,377040748,406795107,60356254,374078096,560583986,13507308,37108919,390026819,103131865,893733906,425718096,503242327,546689046,896034414,322730412,830016747,233676778,755669800,333658230,900914110,557355351,659554106,824580104,610352358,842181708,697570971,457633454,859557456,436699936,228365152,487929223,318447092,36520112,676609456,869218838,945078316,358762590,115086076,487078887,105140302,414903418,369303270,723079185,781996045,35010079,332207777,980330188,346113692,875293652,394264892,452282275,683269960,646642323,765688763,496251030,162639942,768347695,76245924,379013965,431439069,740925481,127244598,72274088,159283742,715440363,913864068,175290131,34264832,658682573,610167645,61455847,622161022,108644696,224993847,365580790,641303213,181590964,854953278,134180724,193524240,910080045,508367506,322646474,106838301,295949507,803301438,62888607,101385573,895390647,627381940,534959992,36333336,566653999,619194647,904476880,828606056,884765157,819710350,43807678,713529654,713893500,952775857,451384655,579714677,420928224,377205079,273827779,64157802,762689409,952146017,956953862,882331357,260960113,941660656,159197461,684262902,944207729,503864933,910476719,232137077,228144854,524200565,212371855,597189217,180979463,655035666,892467910,96085286,677068211,891620069,867946905,206486736,578328496,697308788,443673134,331737692,882998836,106528103,895366759,627567181,316404872,257903755,104116733,217876487,197397799,438452131,942651282,203946544,149730651,505124849,625931960,433799897,749647551,325051334,959049480,41933907,959770765,684244099,614729089,13616595,891384707,287149196,116510538,678626224,388468662,888513948,471400565,736223999,351818364,380206375,865933988,420636892,409876083,604890763,558792773,369468274,942048511,138835853,284649920,278734538,933684339,129171209,731404541,802913018,853641358,574769991,852408253,766955925,409459401,725155208,189636569,662031142,91360807,977514708,696796660,68769196,430994520,73235537,230390002,607725448,34198957,386761822,239065270,308994782,265768919,542993661,856610055,581689302,393018659,823995129,187419348,793630389,866602190,614936365,81301840,95770541,638374586,102094430,761240140,241392678,317103226,27980261,452472984,692856603,297552351,460146110,122737768,988988908,596984147,539819911,661637833,906749516,156051116,297374624,4186833,284643121,363043932,785068062,537695617,281927841,601360305,355468500,243731063,117340423,460605960,47050184,64361799,191183681,634348401,503067391,198250641,550417845,175180957,742072540,239565520,266365683,747620644,53870862,559322589,283328734,328136044,318005340,340860159,409980707,502614087,409800960,769580001,28684318,466010198,647793113,952327199,730693615,271075091,652724389,7246194,791495462,563779995,169325732,996782441,988574829,756876613,366203197,385030507,108747268,35741583,419021379,255260650,457716982,603458688,860924897,507502623,916024227,949951865,617361700,292376610,522016588,496369687,957783605,62291183,728094771,301030712,220285152,165866706,555006616,722006486,352118323,392869679,107175604,834638627,974552022,26719588,941489496,924292573,842869283,811286614,662380187,303731129,497406493,217475191,569226672,618907732,409272030,522732671,975799125,774979958,996072892,635431199,476857888,941301945,1006157,110790396,454344967,622209749,419941369,283694926,117396778,10747884,839365172,94421606,866519141,613355881,692433039,556284813,411095279,519886044,154135874,914051454,395234972,558386215,511659491,249128743,607859067,989100831,870185806,994692985,135809425,556062267,104788674,134736236,161214910,577830025,674966395,66075004,28209923,31237094,993168003,285287152,485969537,142198382,195190166,162074961,685068288,293409806,910304594,730858967,136711743,102597794,143052711,221246869,397951694,855334376,451959590,943504080,593358638,356647110,580912040,594852601,104388860,675763836,461839390,901331440,668561644,131953285,890648730,574380577,983000828,547829984,552116402,69121308,254978041,749879276,44908461,582068580,124904874,955606593,876940886,406774976,11823112,213818141,607945697,480923449,358084887,468439372,652598548,234608914,103921635,698149748,647530215,633552142,395514601,18641336,699811200,842710200,538169333,30153304,211724790,273264494,853665053,954885599,656109437,616736206,520726794,111268587,552236462,719691744,76560902,814366851,443588814,846064123,93832192,173231560,154757436,669316815,679413231,960303690,855731373,287189626,241318716,747106257,778372164,184335871,468751182,317610124,921425597,845645905,905628187,15152421,409661143,91936492,244001607,19002746,676823364,678631846,458354219,593242830,547906184,364861131,414295017,880438799,572494275,217893016,967194835,872748232,972297110,815543573,933985153,295809878,815850904,364627783,55636000,124240943,359017785,463386617,210031204,946974527,907657207,277012522,136309991,547688835,192164214,900045482,345564664,737144583,879809802,466938179,394134064,164662885,589961793,205918572,353058796,714299967,772920088,166368915,481626101,80488510,491798141,176059956,151947536,249748990,647515087,13602605,105663868,106582343,798767988,568752379,340888041,5341465,621785130,934897570,791644881,592646303,427747344,658079770,444117415,981109448,193684958,560273530,696191621,739841151,671604079,501807743,342180743,138255461,755578723,396476351,730657131,173491892,953004180,175068651,64593562,803779689,412706701,294836580,628855837,883723970,817812064,202079032,305586316,452966771,444877769,678719227,254701005,593548123,913158429,692135481,898540537,365977012,205897141,534204880,837121506,812121502,762255185,615368379,667830989,563136271,392820222,195951789,278662889,820517479,876601994,192048541,511235906,555495382,641795130,159882207,956204935,206905483,259426986,585276930,208927987,463140578,708151246,318209333,148926853,450307968,783636372,840642199,158009582,877266236,309147680,118303181,984940147,709904528,238940886,471104361,872550663,2096891,255897079,42521313,635434672,671323972,910248084,377890563,343506724,94715541,236404400,641329056,49118613,709741855,952353086,861915907,599413630,649604965,452045223,415453013,206302595,519342941,177916656,599208565,948600423,556209762,536257589,986351312,285306070,980861025,669405632,389455829,834511511,726842436,123127865,330677494,541236682,365881927,297870290,957550165,743693811,749186496,859128660,305288131,620345313,859667757,215363087,278620767,785689516,766481575,58248054,303932415,560761343,52102028,461987697,924774417,14200914,484122524,434932225,502239534,6177063,557725228,773098152,494196941,246604890,63386630,567007876,632650326,757129957,602777927,293102542,766139871,482201008,742450807,597231446,543786868,405218647,355352281,799106266,819497128,140492813,369432528,923067878,722024561,922989670,465082462,809142208,172200235,720644112,487874941,594747937,449064852,953913892,697407896,938972469,354881563,998176207,652757218,788491365,432335476,488154383,192628586,71055705,555161112,408315730,278923361,34791027,106020058,439402725,881170691,549102804,592946038,53769480,222495557,823978628,918863305,828692776,908880296,540541183,91333620,959384079,953617447,445753801,162433551,561382797,854592329,316901840,846107770,691310652,673362537,399630050,278232708,938710188,390603425,219076380,485766043,452590776,952813953,565139642,3693262,866578879,46388965,191549062,166633107,364311740,493727117,244810244,979397949,330800965,907101180,637852605,734029229,962299334,80389761,177721677,885404260,147605749,199729067,666015858,791833356,741697950,222618580,809798095,627384311,180530211,610654944,718426038,259834672,618911949,915454788,859395706,420385115,836461730,116032909,440357909,76873678,845635386,1181270,780419488,697286125,938277924,73796682,473515077,986404271,829444734,165657836,342004497,404697828,520033840,322377632,110516311,815086410,636997779,560216841,908187237,331385806,168808119,605563461,766998202,677566420,942035137,102527212,715400678,136659846,125420902,374881804,265707529,821360742,709639245,731879945,76011403,930037647,863498635,307905513,264709321,470652600,595446418,400322009,273047831,68860272,419716046,651898445,254039446,797336913,647058359,159595746,117434515,582446615,676941847,598987613,320493695,138251555,954160559,986447722,716147168,785997714,990771540,252993794,134967738,953638216,208835059,810367865,357811987,446616954,619661922,219963794,830530574,57305106,148931127,748774160,231017069,67439148,84350134,639898098,580319102,199233135,457421058,922911637,548670788,867130598,819338375,954076414,166472179,947359994,124431044,864835652,684728126,816163490,830783664,599791356,442550800,827296662,701810975,85465123,907031843,971501638,405463814,156631809,469702825,764459410,662558818,586132039,290694275,122120011,406570345,796065348,660064088,587341217,882454704,658272451,571322785,730788650,767180825,919796563,414601951,758204937,893977198,727370527,545560565,356668989,290697899,282184062,214748561,393699245,815772048,96203034,927906552,812406748,151811045,445588776,281277656,762070372,784895789,331329529,577552301,400274167,693273026,676948004,738389304,367262145,968852520,766648502,689583970,686747542,213936425,355312129,550423695,39356737,272527119,115270386,463536830,667566135,827400168,544472206,914565492,683460067,383537056,813312337,106055801,315177150,874979125,903147426,550503660,826104981,356386688,690228482,971237301,741004700,669097439,344219883,330050994,362993201,518273088,949415817,974429278,697655160,990985832,255729464,997693783,484305472,684786624,468460168,557400831,449641680,452732028,383359406,278123893,861493185,868965416,846517779,117862840,499287752,569873266,143309860,755468936,569403994,560286527,95772989,279252328,453418219,599356366,112758529,294650806,700918451,282941744,66307548,45926545,467000268,305743210,863213911,824855530,756285631,912704936,523508902,546944171,538218087,718380850,555477537,343568396,806044100,204982421,756546658,244944070,370801682,553551524,29688578,945728821,927730685,770312297,626481701,989324871,293381457,186788059,592980861,935999277,15119767,480635306,107562723,373416483,994084771,1470316,507245062,563654927,550642112,972843053,722177906,458556273,559252616,4509870,539899978,935551761,494537434,619502939,680578032,243392849,921659474,795101384,577294115,705619417,652962607,849805238,473033805,426436577,797368555,272868146,297370649,27469548,535863237,738737632,374808518,936851282,800759679,350611365,60347245,819332000,757512121,66055896,454055743,289327682,869176754,632709043,132751912,776910536,765374184,975243545,24655754,6608039,28738287,997770991,463181999,642419352,820826387,413486075,243865970,934672254,715005911,216067591,675333869,160952061,895607615,994701247,403030631,112656834,832117616,560939912,593888785,872154041,22889111,68247856,705311599,514647026,188159583,408353210,55176182,504328677,894968062,636452512,534341531,244933766,84416925,748101951,661236048,275705199,40243527,938323226,466230403,829101311,111468064,65003262,61044248,245561728,765096342,517498504,963435947,190232970,417600693,281378450,520900592,990203494,363188587,3141268,304980098,601619927,566757909,747411547,353628473,91271434,236292045,161174299,454468385,245894033,526422629,546757552,60847950,256498322,687741206,406388546,634834331,780017863,893122140,658485355,274938612,802197195,708280968,834818714,789275065,728351215,785975560,657243670,627182648,958485053,815211064,597764218,362519816,551251582,895211197,869363853,321103657,343270914,729463983,940953600,502739980,643547014,527054503,305096255,107811470,72628097,469214604,331411601,994648,388481163,294701301,558896062,541318053,274701312,775524730,830423887,738575622,383722789,586891098,658412096,335601048,612811654,298484340,46388287,334121528,790720366,990070047,250706440,806769036,251835020,257780059,706195485,106418809,204478004,826106689,608627018,830590858,726935443,843481844,177987817,175481726,303788922,46673625,87163458,713744588,462922861,444135980,32278221,369130232,346967100,640842222,913895629,214071072,437217268,483730558,549413738,632604733,92075072,451736496,189960563,383735848,290889488,202296211,287900816,220910949,830419170,618220871,717493045,163675117,851073342,762985900,245493944,993066580,579560319,749552198,972541664,701228839,270338345,446452681,101719893,144707877,511104313,361199355,178692593,126172532,366424381,524554863,728167346,669882619,5397879,569113370,16430529,942438039,322612600,229010616,96471403,502575818,149073806,969127972,34179420,119364403,530486262,764354731,172191751,597613829,374174726,340393101,521409363,340417579,19487512,456462019,928260057,546618367,277365121,802208694,328220800,928717254,267326936,423030984,609496968,367403697,340416521,140643316,192197022,44898588,183897449,678664147,716291275,707844131,221799979,346990792,29809220,213818629,936520933,862001230,481402911,335155844,565833114,903486883,191132810,370025535,426702653,160884818,967591922,485102046,219809042,513647075,527189398,786182805,601680328,3932081,713424797,542659792,824441863,583804213,401590375,11648000,754921928,586399495,954680801,197654240,374059353,618245608,12467230,37232150,775998066,430462060,414348353,211152673,487205052,864914833,72385330,82153465,15436486,854787581,44095432,174800463,697394727,882625686,247003688,709010306,445964854,411460405,904704123,820361933,713237638,526158122,153070524,985734717,574742187,258741490,797032416,914794487,28347884,781952316,703760566,64373176,97048504,778763914,259392750,461725273,119198296,740360423,634708106,644769953,630828528,734593066,56159275,618195664,80106628,422603031,150635333,227439235,99303672,741639289,941994379,26876855,410298876,645156493,851735809,298997487,758854231,258346651,91319211,285188295,767542936,536514620,723236554,814745586,679492097,613841078,799585547,900020871,166560019,550397497,184643288,265232739,552935968,412115828,458226886,455183344,158813151,864776817,867212366,940162577,853639257,994787290,488352451,607697269,20710642,123654712,791576267,374124095,405493957,602459268,543181148,526907874,71197051,751031698,702158840,145694912,722241137,990163905,231678907,510392580,623551159,67581725,688479251,932406041,881989246,902124482,294699076,936924939,732991849,164553275,448524299,180399159,911077652,199001754,905630459,221772612,948719349,432372302,577955110,701781130,893232896,372380194,738487748,812639463,758801618,774316320,289614812,841075148,46435102,751061271,89755604,577061818,737592881,828657829,151535797,605998269,591659823,124441014,902566158,522349797,501066282,208986243,26068728,922764458,81633301,950026183,573994131,32074025,821004085,143406839,807164859,905656081,338117490,636924749,477358619,551738731,216717031,657642840,105021964,900481883,408943919,165162484,239647278,746092155,665744277,903608194,698467108,280807916,495257965,494938481,944888458,934335688,151306786,106720712,678041723,151709045,231403091,196947704,662600302,55571511,627957229,978405890,351881721,829533472,455611682,273765077,378364946,221601377,322630877,844219229,614714344,451915190,607814320,399767499,463127764,448179828,230386613,93853817,71169106,492268859,660769304,443770752,249299409,42612089,278026471,464752530,126963657,257485504,902125946,652925627,485391425,575591982,39343529,105175674,842093482,410637046,532879606,490528930,576963237,949825550,849400315,336840533,48046573,65365517,461971803,510917867,902713069,931586479,244482098,383153746,118879064,991636533,701851019,583604294,345295819,0});
    int N, K;
    cin >> N >> K;
    K = min(K, N - K);

    if (N - K < mint::mod() and N >= mint::mod()) {
        puts("0");
    } else if (K == 0) {
        puts("1");
    } else {
        N %= mint::mod();
        cout << mint(pe.prod(N - K, N)) / mint(pe.prod(0, K)) << '\n';
    }
}
0