using System; using static System.Console; using System.Linq; using System.Collections.Generic; class Program { static int NN => int.Parse(ReadLine()); static int[] NList => ReadLine().Split().Select(int.Parse).ToArray(); static int[][] NArr(long n) => Enumerable.Repeat(0, (int)n).Select(_ => NList).ToArray(); static int[] NMi => ReadLine().Split().Select(c => int.Parse(c) - 1).ToArray(); static int[][] NMap(int n) => Enumerable.Repeat(0, n).Select(_ => NMi).ToArray(); static string[] SList(long n) => Enumerable.Repeat(0, (int)n).Select(_ => ReadLine()).ToArray(); public static void Main() { Solve(); } static void Solve() { var n = long.Parse(ReadLine()); var c = NList; var x = new long[3][] { new long[] { 1, 0, mod - 1 }, new long[] { mod - 1, 1, 0 }, new long[] { 0, mod - 1, 1 } }; var b = Matrix.Pow(x, n - 1); Write((c[0] * b[0][0] + c[1] * b[1][0] + c[2] * b[2][0]) % mod); Write(" "); Write((c[0] * b[0][1] + c[1] * b[1][1] + c[2] * b[2][1]) % mod); Write(" "); WriteLine((c[0] * b[0][2] + c[1] * b[1][2] + c[2] * b[2][2]) % mod); } static int mod = 1_000_000_007; class Matrix { // 行列の累乗 public static long[][] Pow(long[][] m, long k) { var multi = m; var r = new long[m.Length][]; for (var i = 0; i < m.Length; ++i) { r[i] = new long[m.Length]; r[i][i] = 1; } while (k > 0) { if ((k & 1) == 1) r = Mul(r, multi); multi = Mul(multi, multi); k >>= 1; } return r; } // 行列の積 public static long[][] Mul(long[][] x, long[][] y) { var r = new long[x.Length][]; for (var i = 0; i < x.Length; ++i) r[i] = new long[y[0].Length]; for (var i = 0; i < x.Length; ++i) for (var k = 0; k < x[0].Length; ++k) { for (var j = 0; j < y[0].Length; ++j) r[i][j] = (r[i][j] + x[i][k] * y[k][j]) % mod; } return r; } } }