REMAINDER

#include <bits/stdc++.h>
using namespace std;

// ----------- define --------------
#define int long long
#define vi vector<int>
#define ii pair<int,int>
#define fi first
#define sc second
#define mp make_pair
#define pb push_back
#define pqueue priority_queue
#define popcnt __builtin_popcount
#define getBit(x, k) ((x >> k) & 1)
#define xorBit(x, k) (x ^ (1 << k))
#define siz(x) (int)((x).size())
#define all(x) (x).begin(),(x).end()
// ---------------------------------

int m = -1, s = -1;

int Sum(int a, int b) {
  return (a + b) % m;
}

int Mul(int a, int b) {
  if (b == 0) return 0;
  int t = Mul(a, b / 2);
  t = Sum(t, t);
  if (b % 2) return Sum(t, a);
  return t;
}

int Pow(int a, int b) {
  if (b == 0) return 1;
  int t = Pow(a, b / 2);
  t = Mul(t, t);
  if (b % 2) return Mul(t, a);
  return t;
}

int Sol(int x, int n) {
  if (n == 0) return 0;
  int t = Sol(x, n / 2);
  t = Sum(Mul(t, Pow(10, s * (n / 2))), t);
  if (n % 2) return Sum(Mul(t, Pow(10, s)), x);
  return t;
}

void Main() {
  int x, n;
  cin >> x >> n >> m;
  s = to_string(x).size();
  cout << Sol(x, n) << '\n';
}

signed main() {
#ifdef _DEBUG
  // freopen("in" , "r", stdin );
  cerr << "- ---- -- ----- <3\n";
#endif
  cin.tie(0)->sync_with_stdio(0);
  int T = 1;
  // cin >> T;
  while (T--) Main();
}