// Problem: No.2087 基数の変換
// Contest: yukicoder
// URL: https://yukicoder.me/problems/no/2087
// Memory Limit: 512 MB
// Time Limit: 2000 ms

#include <bits/stdc++.h>

#define fastio ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define dbg(x) cout << #x << " = " << (x) << "\n";
#define popcount(x) __builtin_popcountll((x))
#define all(v) (v).begin(), (v).end()
#define pb emplace_back
#define x first
#define y second

using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;

const int inf = 0x3f3f3f3f;
const int mod = 1e9 + 7;

void solve() {
  ll a, b;
  cin >> a >> b;
  vector<int> ans;
  while (b) {
    ans.pb(b % a);
    b /= a;
  }
  reverse(all(ans));
  for (auto it : ans) cout << it;
  cout << '\n';
}

int main() {
  fastio;
  int t = 1;
  // cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}