#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
using pi = pair<int,int>;
using pl = pair<ll,ll>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (long long i = j; i < (long long)(n); i++)
const long long MOD = 1000000007;
const long long MOD2 = 998244353;
const int INF = ((1<<30)-1);
const long long LINF = (1LL<<60);
const double PI = 3.141592653589793238;
template<class T> inline void chmax(T& a, T b) {if (a < b) {a = b;}}
template<class T> inline void chmin(T& a, T b) {if (a > b) {a = b;}}


int solve(){
    ll n,m; cin >> n >> m;
    vl a(0);
    while(m > 0){
        a.push_back(m%n);
        m /= n;
    }
    reverse(all(a));
    rep(i,0,a.size())cout << a[i];
    cout << endl;

    return 0;
}

int main(){
    cout << fixed << setprecision(10);
    ios::sync_with_stdio(0), cin.tie(0);
    int t = 1; 
    //cin >> t;
    for(int i = 0; i < t; i++){
        solve();
    }
	return 0;
}