#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
using namespace std;
const int maxn = 10000;
int a[maxn];
int main ()
{
int m,n,k,i;
while(scanf("%d%d",&n,&m)==2)
{
memset(a,0,sizeof(a));
if(n<0)
{
printf("-");
n=abs(n);
}
k=-1;
while(n)
{
a[++k]=n%m;
n/=m;
}
if(m>10)
{
for(i=k;i>=0;i--)
{
if(a[i]>=10)
{
switch(a[i])
{
case 10:printf("A");break;
case 11:printf("B");break;
case 12:printf("C");break;
case 13:printf("D");break;
case 14:printf("E");break;
case 15:printf("F");break;
}
}
else
printf("%d",a[i]);
}
printf("\n");
}
else
{
for(i=k;i>=0;i--)
{
printf("%d",a[i]);
}
printf("\n");
}
}
return 0;
}