#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

const int N = 1e5 + 3 , MOD =  1e9 + 7;

#define all(x)  x.begin() , x.end()

#define rep(i , st , en) for(int i = st ;i < en ; i++)

string  sub(string s,string ss)
{
    if(s.size()<ss.size())cout<<"-",swap(s,ss);
    else if(s.size()==ss.size() && s<ss)cout<<"-",swap(s,ss);
    vector<int>v1,v2,res;
    reverse(all(s));
    reverse(all(ss));
    rep(i,0,s.size())v1.push_back(s[i]-'0');
    rep(i,0,ss.size())v2.push_back(ss[i]-'0');
    while(v2.size()<v1.size())v2.push_back(0);
    while(res.size()<v1.size())res.push_back(0);
    res.push_back(0);
    rep(i,0,v1.size())
    {
        if(v1[i]>=v2[i])res[i]=v1[i]-v2[i];
        else
        {
            res[i]=10+v1[i]-v2[i];
            v1[i+1]--;
        }
    }
    while(res.size()>1 && res.back()==0)res.pop_back();
    reverse(all(res));
    s="";
    rep(i,0,res.size())s+=(char)(res[i]+'0');
    return s;
}
pair<string,string> div(string s,string ss)
{
    if(s.size()<ss.size())return {"0",s};
    else if(s.size()==ss.size() && s<ss)return {"0",s};
    else
    {
        vector<int>res;
        int r=0;
        string te="";
        while(1)
        {
            while(r<s.size() && te.size()<ss.size() && te!="0")te+=s[r],r++,res.push_back(0);
            if(te=="0")
            {
                res.push_back(0);
                if(r==s.size())
                {
                    s="0";
                    break;
                }
                te="";
                te+=s[r];
                r++;
                continue;
            }
            if(r==s.size())
            {
                if(te.size()<ss.size())
                {
                    s=te;
                    res.push_back(0);
                    break;
                }
                if(te.size()==ss.size() && ss>te)
                {
                    s=te;
                    res.push_back(0);
                    break;
                }
            }
            if(te.size()==ss.size() && ss>te && r<s.size())te+=s[r],r++,res.push_back(0);
            string tt = sub(te,ss);
            int divv=1;
            while(tt.size()>ss.size() || (tt.size()==ss.size() && tt>=ss))
            {
                divv++;
                tt=sub(tt,ss);
            }
            res.push_back(divv);


            if(r==s.size())
            {
                s=tt;
                break;
            }
            if(tt=="0")te=s[r];
            else te=tt+s[r];
            r++;
        }
        string divi="";
        reverse(all(res));
        while(res.size()>1 && res.back()==0)res.pop_back();
        reverse(all(res));
        rep(i,0,res.size())divi+=(char)(res[i]+'0');
        reverse(all(s));
        while(s.size()>1 && s.back()=='0')s.pop_back();
        reverse(all(s));
        return {divi,s};
    }
}

string add(string s,string ss)
{
    vector<int>v1,v2,res;
    reverse(all(s));
    reverse(all(ss));
    rep(i,0,s.size())v1.push_back(s[i]-'0');
    rep(i,0,ss.size())v2.push_back(ss[i]-'0');
    while(v1.size()<v2.size())v1.push_back(0);
    while(v2.size()<v1.size())v2.push_back(0);
    while(res.size()<v1.size())res.push_back(0);
    int carry=0;
    rep(i,0,v1.size())
    {
        int sum=v1[i]+v2[i]+carry+res[i];
        res[i]=sum%10;
        carry=sum/10;
    }
    if(carry)
    {
        res.push_back(carry);
    }
    reverse(all(res));
    string te="";
    rep(i,0,res.size())te+=(char)(res[i]+'0');
    return te;
}
string mul(string s,string ss)
{
    if(s.size()<ss.size())swap(s,ss);
    vector<int>v1,v2,res;
    reverse(all(s));
    reverse(all(ss));
    rep(i,0,s.size())v1.push_back(s[i]-'0');
    rep(i,0,ss.size())v2.push_back(ss[i]-'0');
    rep(i,0,s.size()+ss.size())res.push_back(0);
    rep(i,0,v2.size())
    {
        rep(j,0,v1.size())
        {
            int sum = v1[j]*v2[i];
            sum+=res[i+j];
            res[i+j]=sum%10;
            res[i+j+1]+=sum/10;
        }
        int j=v1.size(),carry=res[i+j];
        while(carry)
        {
            int sum=carry;
            res[i+j]=sum%10;
            carry = sum/10;
            j++;
        }
    }
    while(res.size()>1 && res.back()==0)res.pop_back();
    reverse(all(res));
    s="";
    rep(i,0,res.size())s+=(char)(res[i]+'0');
    return s;
}

string co(char c)
{
    if(isdigit(c)) return to_string(c - '0') ;
    if( c >= 'A' && c <= 'Z' ) return to_string( c - 'A' + 10 ) ;

    return to_string( c - 'a' + 36 ) ;
}

char co2(string s)
{
    int x = stoi(s) ;

    if(x < 10) return '0' + x;

    if( x < 36 ) return 'A' + x - 10 ;

    return 'a' + x - 36 ;
}

int32_t main() {

    cin.tie(0);cin.sync_with_stdio(0);
    cout.tie(0);cout.sync_with_stdio(0);

    int  x , y ;
    cin >> x >> y ;

    string z ;
    cin >> z;

    string zz = "" ;
    string xx = to_string(x) ;
    string yy = to_string(y) ;

    for(char c : z)
    {
        zz = add ( mul( zz,  xx ) , co(c) ) ;
    }

    pair<string , string > d = div( zz , yy ) ;
    string res = "" ;
    res += co2( d.second)  ;

    while ( d.first != "0" )
    {
        d = div( d.first , yy ) ;

        res += co2( d.second)  ;
    }

    reverse(res.begin() , res.end()) ;

    cout << res;

    return 0;
}