import std.conv, std.functional, std.range, std.stdio, std.string; import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons; import core.bitop; class EOFException : Throwable { this() { super("EOF"); } } string[] tokens; string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; } int readInt() { return readToken.to!int; } long readLong() { return readToken.to!long; } real readReal() { return readToken.to!real; } bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } } bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } } int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; } int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); } int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); } struct ModInt(uint M_) { import std.conv : to; alias M = M_; uint x; this(ModInt a) { x = a.x; } this(uint x_) { x = x_ % M; } this(ulong x_) { x = cast(uint)(x_ % M); } this(int x_) { x = ((x_ %= cast(int)(M)) < 0) ? (x_ + cast(int)(M)) : x_; } this(long x_) { x = cast(uint)(((x_ %= cast(long)(M)) < 0) ? (x_ + cast(long)(M)) : x_); } ref ModInt opAssign(T)(inout(T) a) if (is(T == uint) || is(T == ulong) || is(T == int) || is(T == long)) { return this = ModInt(a); } ref ModInt opOpAssign(string op, T)(T a) { static if (is(T == ModInt)) { static if (op == "+") { x = ((x += a.x) >= M) ? (x - M) : x; } else static if (op == "-") { x = ((x -= a.x) >= M) ? (x + M) : x; } else static if (op == "*") { x = cast(uint)((cast(ulong)(x) * a.x) % M); } else static if (op == "/") { this *= a.inv(); } else static assert(false); return this; } else static if (op == "^^") { if (a < 0) return this = inv()^^(-a); ModInt b = this, c = 1U; for (long e = a; e; e >>= 1) { if (e & 1) c *= b; b *= b; } return this = c; } else { return mixin("this " ~ op ~ "= ModInt(a)"); } } ModInt inv() const { uint a = M, b = x; int y = 0, z = 1; for (; b; ) { const q = a / b; const c = a - q * b; a = b; b = c; const w = y - cast(int)(q) * z; y = z; z = w; } assert(a == 1); return ModInt(y); } ModInt opUnary(string op)() const { static if (op == "+") { return this; } else static if (op == "-") { ModInt a; a.x = x ? (M - x) : 0U; return a; } else static assert(false); } ModInt opBinary(string op, T)(T a) const { return mixin("ModInt(this) " ~ op ~ "= a"); } ModInt opBinaryRight(string op, T)(T a) const { return mixin("ModInt(a) " ~ op ~ "= this"); } bool opCast(T: bool)() const { return (x != 0U); } string toString() const { return x.to!string; } } enum MO = 10^^4; alias Mint = ModInt!MO; Mint linearRecurrenceAt(Mint[] as, Mint[] cs, long N) { const d = cast(int)(cs.length) - 1; Mint[] mul(Mint[] fs, Mint[] gs) { auto hs = new Mint[d + d - 1]; foreach (i; 0 .. d) foreach (j; 0 .. d) { hs[i + j] += fs[i] * gs[j]; } foreach_reverse (i; d .. d + d - 1) { foreach (j; 1 .. d + 1) { hs[i - j] -= cs[j] * hs[i]; } } hs.length = d; return hs; } auto xs = new Mint[d]; auto ys = new Mint[d]; xs[1] = 1; ys[0] = 1; for (long e = N; e; e >>= 1) { if (e & 1) ys = mul(ys, xs); xs = mul(xs, xs); } Mint ans; foreach (i; 0 .. d) { ans += as[i] * ys[i]; } return ans; } void main() { try { for (; ; ) { const S = readToken; const M = readLong; const L = readLong; auto to = new int[MO]; foreach (n; 0 .. MO) { // (a^M - b^M) / sqrt(D) Mint res = linearRecurrenceAt([0, 1].to!(Mint[]), [1, -n, -1].to!(Mint[]), M); if (M & 1) { res -= 1; } else { // if (n == 0) { // res += 1; // } } to[n] = res.x; } debug { writeln(to[0 .. 10]); } int ini; foreach (i; 0 .. 4) { ini = ini * 10 + (S[i] - '0'); } auto app = new int[MO]; app[] = -1; auto us = new int[MO + 1]; us[0] = ini; for (int i = 0; ; ++i) { if (~app[us[i]]) { const j = app[us[i]]; long l = L; if (l >= j) { l = j + (l - j) % (i - j); } writefln("%04d", us[cast(int)(l)]); break; } app[us[i]] = i; us[i + 1] = to[us[i]]; } } } catch (EOFException e) { } }