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
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
//Konrad Paluszek, University of Warsaw (former XIV LO Warsaw)
#ifndef LOCAL
#pragma GCC optimize("O3")
#endif
#include "message.h"
#include "futbol.h"
#include <bits/stdc++.h>
using namespace std;
#define sim template <class c
#define mor > muu & operator<< (
#define ris return *this
#define R22(r) sim> typename enable_if<1 r sizeof(dud<c>(0)), muu&>::type operator<<(c g) {
sim> struct rge {c h, n;};
sim> rge<c> range(c h, c n) {return rge<c>{h, n};}
sim, class F> struct rgm {c h, n; F f;};
sim, class F> rgm<c, F> map_range(c b, c e, F f) {return rgm<c, F>{b, e, f};}
sim, class F> rgm<typename c::const_iterator, F> map_range(const c &x, F f) {return map_range(x.begin(), x.end(), f);}
sim> auto dud(c *r) -> decltype(cerr << *r);
sim> char dud(...);
struct muu {
#ifdef LOCAL
	stringstream a;
	~muu() {cerr << a.str() << endl;}
	R22(<) a << boolalpha << g; ris;}
	R22(==) ris << range(begin(g), end(g));}
	sim mor rge<c> u) {
		a << '{';
		for (c s = u.h; s != u.n; ++s)
			*this << ", " + 2 * (s == u.h) << *s;
		ris << '}';
	}
	sim, class n mor pair <c,n> r) {ris << "(" << r.first << ", " << r.second << ")";}
	sim, class F mor rgm<c, F> u) {
		for (c s = u.h; s != u.n; ++s)
			u.f(*this << ", " + 2 * (s == u.h), *s);
		ris;
	}
	#else
	sim mor const c&) {ris;}
	#endif
	muu & operator()() {ris;}
};
const int myID = MyNodeId();
#define debug (muu() << "Node " << myID << "_" << __FUNCTION__ << "#" << __LINE__ << ": ")
#define imie(r) "[" #r ": " << (r) << "] "
#define imask(r) "[" #r ": " << bitset<8 * sizeof(r)>(r) << "] "
#define arr(a, i) "[" #a imie(i) ": " << a[i] << "] "
#define arr2(a, i, j) "[" #a imie(i) imie(j) << ": " << a[i][j] << "] "
const int P = GetP(), K = GetK();
using ll = long long;
ll powe(ll b, int e) {
	ll r = 1;
	while (e) {
		if (e & 1)
			r = r * b % P;
		b = b * b % P;
		e >>= 1;
	}
	return r;
}
ll inv(ll x) {
	return powe(x, P - 2);
}
using matr = pair <array<array<ll, 2>, 2 >, ll>;
matr make_matr(int a, int b, int c, int d, int e) {
	matr res;
	res.first[0][0] = a;
	res.first[0][1] = b;
	res.first[1][0] = c;
	res.first[1][1] = d;
	res.second = e;
	return res;
}
matr id = make_matr(1, 0, 0, 1, 1);
using vec = array<ll, 2>;
vec operator*(const vec &v, const matr &a) {
	vec res = {};
	for (int i = 0; i < 2; ++i)
		for (int j = 0; j < 2; ++j)
			res[i] += v[j] * a.first[j][i];
	ll ii = inv(a.second);
	for (int i = 0; i < 2; ++i) {
		res[i] %= P;
		res[i] *= ii;
		res[i] %= P;
	}
	return res;
}
matr gen(int n) {
	return make_matr((n - K + 1) * 2 % P, 0, -(n - K + 1), n + 1, n - K + 1);
}
matr operator*(const matr &a, const matr &b) {
	matr res = make_pair(array<array<ll, 2>, 2>{}, 1);
	for (int i = 0; i < 2; ++i)
		for (int j = 0; j < 2; ++j)
			for (int k = 0; k < 2; ++k)
				res.first[i][k] += a.first[i][j] * b.first[j][k];
	for (int i = 0; i < 2; ++i)
		for (int j = 0; j < 2; ++j)
			res.first[i][j] %= P;
	res.second = a.second * b.second % P;
	return res;
}
const int nax = 1e9;
int split(int nr) {
	return K + (nax - K) * 1ll * nr / 99;
}
int main() {
	if (myID == 0) {
		int n = GetN();
		if (n <= K) {
			printf("%lld\n", powe(2, n));
			return 0;
		}
		int ins = -1;
		for (int nr = 1; nr < 100; ++nr) {
			if (split(nr) >= n) {
				ins = nr;
				break;
			}
		}
		assert(ins != -1);
		matr mul = id;
		for (int i = split(ins - 1); i < n; ++i)
			mul = mul * gen(i);
		matr pref = id;
		for (int i = 1; i < ins; ++i) {
			matr curr = id;
			Receive(i);
			curr.first[0][0] = GetInt(i);
			curr.first[0][1] = GetInt(i);
			curr.first[1][0] = GetInt(i);
			curr.first[1][1] = GetInt(i);
			curr.second = GetInt(i);
			pref = pref * curr;
		}
		pref = pref * mul;
		vec init = {powe(2, K), 1};
		init = init * pref;
		if (init[0] < 0)
			init[0] += P;
		printf("%lld\n", init[0]);
	}
	else {
		int low = split(myID - 1), high = split(myID);
		matr mul = id;
		for (int i = low; i < high; ++i)
			mul = mul * gen(i);
		PutInt(0, mul.first[0][0]);
		PutInt(0, mul.first[0][1]);
		PutInt(0, mul.first[1][0]);
		PutInt(0, mul.first[1][1]);
		PutInt(0, mul.second);
		Send(0);
	}
	/*
		debug << imie(n) imie(K) imie(P);
		vec init = {powe(2, K), 1};
		matr mul = id;
		for (int i = K; i < n; ++i) {
			matr curr = gen(i);
			mul = mul * curr;
		}
		init = init * mul;
		debug << imie(init);
		if (init[0] < 0)
			init[0] += P;
		printf("%lld\n", init[0]);
	*/
}