C++ :

#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <sstream>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <numeric>
#include <cassert>
#include <complex>
#include <ctime>

#define clr(x,a) memset(x,a,sizeof(x))
#define sz(x) (int)x.size()
#define rep(i,n) for(int i=0;i<n;i++)
#define repeat(i, a, b) for(int i=(a);i<=(b);i++)
#define all(v) (v).begin(), (v).end()
#define Unique(store) store.resize(unique(store.begin(),store.end())-store.begin())
#define X first
#define Y second



using namespace std;

const int MAX=40;
int num[MAX];

void turn (int n,int k){
    int cnt=0;
    if (n<0){cout<<'-';n=-n;}
    while (n){
        num[++cnt]=n%k;
        n/=k;
    }
    for (int i=cnt;i>=1;i--)
        if (num[i]>=10)
            cout<<char (num[i]-10+'A');
        else
            cout<<num[i];
    cout<<endl;
}
int main () {
    //freopen("in.txt","r",stdin);
    //freopen("out.txt","w",stdout);
    //srand(time(NULL));
    int n,k;
    while (cin>>n>>k) {
        turn(n,k);
    }
    return 0;
}