#define MOD_TYPE 1 #pragma region Macros #include using namespace std; /* #include #include using multiInt = boost::multiprecision::cpp_int; using lld = boost::multiprecision::cpp_dec_float_100; */ /* #pragma GCC target("avx2") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") */ using ll = long long int; using ld = long double; using pii = pair; using pll = pair; using pld = pair; template using smaller_queue = priority_queue, greater>; constexpr ll MOD = (MOD_TYPE == 1 ? (ll)(1e9 + 7) : 998244353); //constexpr ll MOD = 1; constexpr int INF = (int)1e9 + 10; constexpr ll LINF = (ll)4e18; constexpr double PI = acos(-1.0); constexpr double EPS = 1e-11; constexpr int Dx[] = {0, 0, -1, 1, -1, 1, -1, 1, 0}; constexpr int Dy[] = {1, -1, 0, 0, -1, -1, 1, 1, 0}; #define REP(i, m, n) for (ll i = m; i < (ll)(n); ++i) #define rep(i, n) REP(i, 0, n) #define REPI(i, m, n) for (int i = m; i < (int)(n); ++i) #define repi(i, n) REPI(i, 0, n) #define MP make_pair #define MT make_tuple #define YES(n) cout << ((n) ? "YES" : "NO") << "\n" #define Yes(n) cout << ((n) ? "Yes" : "No") << "\n" #define possible(n) cout << ((n) ? "possible" : "impossible") << "\n" #define Possible(n) cout << ((n) ? "Possible" : "Impossible") << "\n" #define Yay(n) cout << ((n) ? "Yay!" : ":(") << "\n" #define all(v) v.begin(), v.end() #define NP(v) next_permutation(all(v)) #define dbg(x) cerr << #x << ":" << x << "\n"; inline void init_main() { cin.tie(0); ios::sync_with_stdio(false); cout << setprecision(30) << setiosflags(ios::fixed); } template inline bool chmin(T &a, T b) { if (a > b) { a = b; return true; } return false; } template inline bool chmax(T &a, T b) { if (a < b) { a = b; return true; } return false; } inline ll CEIL(ll a, ll b) { return (a + b - 1) / b; } template inline void Fill(A (&array)[N], const T &val) { fill((T *)array, (T *)(array + N), val); } template constexpr istream &operator>>(istream &is, pair &p) noexcept { is >> p.first >> p.second; return is; } template constexpr ostream &operator<<(ostream &os, pair &p) noexcept { os << p.first << " " << p.second; return os; } #pragma endregion #pragma region mint template struct Fp { long long val; constexpr Fp(long long v = 0) noexcept : val(v % MOD) { if (val < 0) v += MOD; } constexpr int getmod() { return MOD; } constexpr Fp operator-() const noexcept { return val ? MOD - val : 0; } constexpr Fp operator+(const Fp &r) const noexcept { return Fp(*this) += r; } constexpr Fp operator-(const Fp &r) const noexcept { return Fp(*this) -= r; } constexpr Fp operator*(const Fp &r) const noexcept { return Fp(*this) *= r; } constexpr Fp operator/(const Fp &r) const noexcept { return Fp(*this) /= r; } constexpr Fp &operator+=(const Fp &r) noexcept { val += r.val; if (val >= MOD) val -= MOD; return *this; } constexpr Fp &operator-=(const Fp &r) noexcept { val -= r.val; if (val < 0) val += MOD; return *this; } constexpr Fp &operator*=(const Fp &r) noexcept { val = val * r.val % MOD; if (val < 0) val += MOD; return *this; } constexpr Fp &operator/=(const Fp &r) noexcept { long long a = r.val, b = MOD, u = 1, v = 0; while (b) { long long t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v); } val = val * u % MOD; if (val < 0) val += MOD; return *this; } constexpr bool operator==(const Fp &r) const noexcept { return this->val == r.val; } constexpr bool operator!=(const Fp &r) const noexcept { return this->val != r.val; } friend constexpr ostream &operator<<(ostream &os, const Fp &x) noexcept { return os << x.val; } friend constexpr istream &operator>>(istream &is, Fp &x) noexcept { return is >> x.val; } }; Fp modpow(const Fp &a, long long n) noexcept { if (n == 0) return 1; auto t = modpow(a, n / 2); t = t * t; if (n & 1) t = t * a; return t; } using mint = Fp; #pragma endregion template class Matrix { public: size_t N, M; vector> data; Matrix(size_t N_, size_t M_) : N(N_), M(M_) { data.resize(N, vector(M)); } Matrix operator+(const Matrix &A) { assert(A.N == N && A.M == M); Matrix res(N, M); rep(i, N) rep(j, M) res[i][j] = data[i][j] + A[i][j]; return res; } Matrix &operator+=(const Matrix &A) { assert(A.N == N && A.M == M); rep(i, N) rep(j, M) data[i][j] += A[i][j]; return *this; } Matrix operator-(const Matrix &A) { assert(A.N == N && A.M == M); Matrix res(N, M); rep(i, N) rep(j, M) res.data[i][j] = data[i][j] - A[i][j]; return res; } Matrix &operator-=(const Matrix &A) { assert(A.N == N && A.M == M); rep(i, N) rep(j, M) data[i][j] -= A[i][j]; return *this; } Matrix operator*(const Matrix &A) { assert(M == A.N); Matrix res(N, A.M); rep(i, N) rep(j, A.M) { rep(k, M) res[i][j] += data[i][k] * A[k][j]; } return res; } Matrix &operator*=(const Matrix &A) { return *this = *this * A; } Matrix operator*(T a) { Matrix res(N, M); rep(i, N) rep(j, M) res[i][j] = data[i][j] * a; return res; } Matrix &operator*=(ll a) { rep(i, N) rep(j, M) data[i][j] *= a; return *this; } inline const vector &operator[](int index) const { return (data.at(index)); } inline vector &operator[](int index) { return (data.at(index)); } bool operator==(Matrix &A) { if (N != A.N || M != A.M) return false; rep(i, N) rep(j, M) { if (data[i][j] != A[i][j]) return false; } return true; } bool operator!=(Matrix &A) { return !(*this == A); } Matrix transpose() { Matrix res(M, N); rep(i, N) rep(j, M) res[j][i] = data[i][j]; return res; } T trace() { assert(N == M); T res = 0; rep(i, N) res += data[i][i]; return res; } void display() { rep(i, N) { rep(j, M) cerr << data[i][j] << " "; cerr << "\n"; } } Matrix E(const int n) { Matrix res(n, n); rep(i, n) rep(j, n) res[i][j] = (i == j); return res; } Matrix pow(ll n) { assert(N == M); Matrix P = *this, res = E(N); while (n > 0) { if (n & 1) res *= P; P *= P; n >>= 1; } return res; } }; template Matrix operator*(ll a, Matrix &A) { Matrix res(A.N, A.M); rep(i, A.N) rep(j, A.M) res[i][j] = A[i][j] * a; return res; } void solve() { ll n; cin >> n; Matrix mt(3, 1), tran(3, 3); rep(i, 3) cin >> mt[i][0]; tran[0][0] = tran[1][1] = tran[2][2] = 1; tran[0][1] = tran[1][2] = tran[2][0] = -1; tran[0][2] = tran[1][0] = tran[2][1] = 0; tran = tran.pow(n - 1); mt = tran * mt; cout << mt[0][0] << " " << mt[1][0] << " " << mt[2][0] << "\n"; } main() { init_main(); solve(); }