#include <bits/stdc++.h>
using namespace std;
int main() {
  int a;
  long long n;
  cin >> a >> n;
  int m = 1e7;
  cout << m << endl;
  map<int, int> mp;
  vector<int> cnt;
  long long x = 1;
  for (int i = 1; i <= m; i++) {
    x = x % m * a % m;
    if (mp[x] != 0) {
      break;
    } else {
      mp[x]++;
      cnt.push_back(x);
    }
  }
  cout << cnt[n % (cnt.size()) - 1] << endl;
  return 0;
}