#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <string>
#include <map>
#include <vector>
#include <set>
#include <bitset> 
#include <cmath> 
#include <queue>
using namespace std;

#define x first
#define y second

typedef long long LL;
typedef unsigned long long ULL;
typedef long double LD;
typedef pair<int,int> PII;
typedef pair<LL,LL> PLL;
typedef pair<double,double> PDD; 
typedef pair<LD,int> PLDI;
typedef pair<LD,LD> PLDLD;
typedef pair<int,PII> PIII;
const int N = 200010,M=2*N,U=200000,P=13331,INF=1e9+10,mod=998244353;
const double PI=acos(-1);

char str[N];
 
vector<int> add(vector<int> &A, vector<int> &B)
{
    if (A.size() < B.size()) return add(B, A);

    vector<int> C;
    int t = 0;
    for (int i = 0; i < A.size(); i ++ )
    {
        t += A[i];
        if (i < B.size()) t += B[i];
        C.push_back(t % 10);
        t /= 10;
    }

    if (t) C.push_back(t);
    return C;
}

vector<int> sub(vector<int> &A, vector<int> &B)
{
    vector<int> C;
    for (int i = 0, t = 0; i < A.size(); i ++ )
    {
        t = A[i] - t;
        if (i < B.size()) t -= B[i];
        C.push_back((t + 10) % 10);
        if (t < 0) t = 1;
        else t = 0;
    }

    while (C.size() > 1 && C.back() == 0) C.pop_back();
    return C;
}

vector<int> div(vector<int> &A, int b, int &r)
{
    vector<int> C;
    r = 0;
    for (int i = A.size() - 1; i >= 0; i -- )
    {
        r = r * 10 + A[i];
        C.push_back(r / b);
        r %= b;
    }
    reverse(C.begin(), C.end());
    while (C.size() > 1 && C.back() == 0) C.pop_back();
    return C;
}

// C = A * b, A >= 0, b >= 0
vector<int> mul(vector<int> &A, int b)
{
    vector<int> C;

    int t = 0;
    for (int i = 0; i < A.size() || t; i ++ )
    {
        if (i < A.size()) t += A[i] * b;
        C.push_back(t % 10);
        t /= 10;
    }

    while (C.size() > 1 && C.back() == 0) C.pop_back();

    return C;
}

int p,q;

int get1(char c)
{
	if(c>='0'&&c<='9') return c-'0';
	else if(c>='A'&&c<='Z') return c-'A'+10;
	else return c-'a'+36;
}

char get2(int x)
{
	if(x>=0&&x<=9) return '0'+x;
	else if(x>=10&&x<=35) return 'A'+x-10;
	else return 'a'+x-36;
}

int main()
{ 
	scanf("%d%d%s",&p,&q,str);
	int len=strlen(str);
	if(len==1&&str[0]=='0')
	{
		puts("0");
		return 0;
	}
	vector<int> res;
	res.push_back(0);
	for(int i=len-1;i>=0;i--)
	{
		vector<int> temp;
		temp.push_back(1);
		for(int j=0;j<len-1-i;j++) 
		{
			auto C=mul(temp,p);
			temp=C;
		}
		int v=get1(str[i]);
		auto C=mul(temp,v);
		temp=C;
		C=add(res,temp);
		res=C;
	}
	vector<int> ans;
	while(true)
	{
		if(res.size()==1&&res[0]==0) break;
		int r;
    	auto C = div(res, q, r);
    	ans.push_back(r);
    	res=C;
	}
	for(int i=(int)ans.size()-1;i>=0;i--)
		printf("%c",get2(ans[i]));
	puts("");
	return 0;
}