#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
#define drep(i, cc, n) for (ll i = (cc); i <= (n); ++i)
#define rep(i, n) drep(i, 0, n - 1)
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define fi first
#define se second

const ll MOD = 1000000007;
const ll MOD2 = 998244353;
const ll INF = 1LL << 60;
const ll MAX_N = 2e5;

int main(){
    ll n, m;
    cin >> n >> m;

    if(m == 0){
        cout << 0 << endl;
        return 0;
    }

    vector<ll> ans;
    while(m){
        ans.pb(m%n);
        m /= n;
    }

    for(ll i=(ll)ans.size()-1; i>=0; i--) cout << ans[i];
    cout << endl;
}