// Pratiyush Mishra

#include <bits/stdc++.h>
#define ull unsigned long long int
#define ll long long int
#define LL_MAX 9223372036854775807
#define pb push_back
#define pf push_front
#define mp make_pair
#define popb pop_back
#define vl vector<ll>
#define pl pair<ll,ll>
#define bs(v, x) binary_search(v.begin(), v.end(), x)
#define mem1(a) memset(a, -1, sizeof(a))
#define popf pop_front
#define p0(x) cout << x << " "
#define p1(x) cout << x << '\n'
#define p2(x, y) cout << x << " " << y << '\n'
#define p3(x, y, z) cout << x << " " << y << " " << z << '\n'
#define printv(v)                   \
  for (ll i = 0; i < v.size(); ++i) \
    cout << v[i] << " ";            \
  cout << '\n'
#define pr1(x) cout << fixed << setprecision(15) << x << '\n'
#define ordered_set tree<pair<ll, ll>, null_type, less<pair<ll, ll>>, rb_tree_tag, tree_order_statistics_node_update>
// ordered_set s ; s.order_of_key(val)  no. of elements strictly less than val
// s.find_by_order(i)  itertor to ith element (0 indexed)
#define mod 1000000007
#define mod1 998244353
#define fio                         \
  ios_base::sync_with_stdio(false); \
  cin.tie(NULL)
#define get(n) \
  ll n;        \
  cin >> n
#define getvec(v, n)         \
  vector<ll> v(n);           \
  for (ll i = 0; i < n; i++) \
    cin >> v[i];
#define getstr(s) \
  string s;       \
  cin >> s
#define all(x) x.begin(), x.end()
#define countBits(x) __builtin_popcount(x)
using namespace std;

int val(char c)
{
  if (c >= '0' && c <= '9')
    return (int)c - '0';
  else
    return (int)c - 'a' + 10;
}
int toDeci(string str, int base)
{
  int len = str.size();
  int power = 1;

  int num = 0;
  for (int i = len - 1; i >= 0; i--) {
    if (val(str[i]) >= base) {
      printf("Invalid Number");
      return -1;
    }
    num += val(str[i]) * power;
    power = power * base;
  }

  return num;
}

char reVal(int num)
{
  if (num >= 0 && num <= 9)
    return (char)(num + '0');
  else
    return (char)(num - 10 + 'a');
}

string fromDeci(int base, int inputNum)
{
  string res = "";
  while (inputNum > 0) {

    res += reVal(inputNum % base);
    inputNum /= base;
  }
  reverse(res.begin(), res.end());

  return res;
}

void convertBase(string s, int a, int b)
{
  int num = toDeci(s, a);
  string ans = fromDeci(b, num);
  cout << ans;
}


void mainSolve()
{
  string x, y;
  int n, m, o;
  cin >> x >> m >> y >> n >> o;
  int ans = toDeci(x, m) * toDeci(y, n);
  string val = to_string(ans);
  convertBase(val, 10, o);
}

int main()
{
  fio;
#ifndef ONLINE_JUDGE
  freopen("input.txt", "r", stdin);
  freopen("output.txt", "w", stdout);
#endif
  //get(t);
  ll t = 1;
  while (t--)
  {
    mainSolve();
  }
  return 0;
}