1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
#include <bits/stdc++.h>
#include <unistd.h>
#include "message.h"
using namespace std;

using u64 = uint64_t;
using i64 = int64_t;
using ci64 = int64_t const;
using vi = vector<i64>;
using vvi = vector<vector<i64>>;
using cvi = vector<i64> const;
using cvvi = vector<vector<i64>> const;
using D = double;


// print tuples {{{
template <typename T1, typename T2>
ostream& operator<<(ostream& os, const pair<T1, T2>& t) {
    return os << '[' << t.first << ',' << t.second << ']';
}
void print_tpl_helper(ostream&, bool) {}
template <typename T, typename ...Ts>
void print_tpl_helper(ostream& os, bool first, const T& v, const Ts& ...vs) {
    if (!first){os << ',';} os << v; print_tpl_helper(os, false, vs...);
}
template <typename ...Ts>
ostream& print_struct(ostream& os, const char* classname, const Ts& ...vs) {
        // todo: named fields
    os << classname << '('; print_tpl_helper(os, true, vs...); return os << ')';
}
struct Example {
    char symbol;
    u64 val;
    friend ostream& operator<<(ostream& os, const Example& elem) {
        return print_struct(os, "Op", elem.symbol, elem.val);
    }
};
// }}}
// print containers {{{
template <typename It>
void print(ostream& os, It begin, It end, u64 len, u64 limit = 17) {
    u64 count = 0;
    os << "{";
    while (begin != end && count < limit) {
        os << "(" << *begin << ")";
        count++;
        begin++;
    }
    if (begin != end)
        os << "... " << len << " total";
    os << "}";
}
#define MAKE_PRINTER_1(container) \
template <typename T> ostream& operator<<(ostream& os, const container<T>& t) { print(os, t.begin(), t.end(), t.size()); return os; }
#define MAKE_PRINTER_2(container) \
template <typename T1, typename T2> \
ostream& operator<<(ostream& os, const container<T1, T2>& t) { \
    print(os, t.begin(), t.end(), t.size()); \
    return os; \
}
MAKE_PRINTER_1(vector)
MAKE_PRINTER_2(map)
MAKE_PRINTER_1(set)
MAKE_PRINTER_2(unordered_map)
MAKE_PRINTER_1(unordered_set)
#undef MAKE_PRINTER_1
#undef MAKE_PRINTER_2
// }}}
// read/write {{{
template <typename T> struct identity { const T& operator()(const T& t) const { return t; } };
#define PRINTERS(FNAME, OUTP) \
    template <typename T> void FNAME(const T& t) { OUTP << t << ' '; } \
    void FNAME##ln() { OUTP << '\n'; } \
    template <typename T> void FNAME##ln(const T& t) { OUTP << t << '\n'; } \
    template <typename T, typename F = identity<typename T::value_type>> \
    void FNAME##v(const T& t, F f = F()) { for (const auto& e : t) FNAME(f(e)); FNAME##ln(); }
PRINTERS(print, cout)
#ifdef DEBUG_PRINTS
    PRINTERS(dprint, cerr)
#else
# define dprint(...)
# define dprintv(...)
# define dprintln(...)
#endif
/// }}}
// range, len, max {{{
i64 max(i64 a, i64 b) { return a < b ? b : a; }
vi range(i64 start, i64 end) {
    vi v;
    for (i64 i = start; i < end; i++)
        v.push_back(i);
    return v;
}
vi range(i64 end) { return range(0, end); }
template <typename DS>
i64 len(DS t) { return (i64)t.size(); }
// }}}
// {{{ futbol.h
#ifdef MY_COMPUTER

int GetN() { return 10; }
int GetP() { return 13; }
int GetK() { return 3; }

#else
#include "futbol.h"
#endif
// }}}
#ifdef WITHOUT_RPA // {{{ message
int MyNodeId() { return 0; }
#endif // }}}

i64 p;
i64 solve(i64 n, i64 k) {
    vector<i64> r(n + 1, 1);
    i64 prev = 1;
    i64 res = 1;
    for (i64 i = 1; i <= k; i++) {
        prev = r[i];
        r[i] = 1;
        for (i64 j = i + 1; j <= n; j++) {
            i64 const new_prev = r[j];
            r[j] = (prev + r[j - 1]) % p;
            prev = new_prev;
        }
        res = (res + r[n]) % p;
        dprint(i); dprintln(r);
    }
    return res;
}

void go() {
    if (MyNodeId() != 0)
        return;
    i64 const n = GetN();
    p = GetP();
    i64 const k = min((i64)GetK(), n);
    println(solve(n, k));
}

int main () { // {{{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    go();
} //