#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
int n,R,modNum,temp;
int main(){
    string ans="";
    cin >>n >>R;
    temp=n;
    while(n!=0){
        modNum=n%R;
        n/=R;
        //判断余数modNum是否小于0
        if(modNum<0){
            modNum=modNum-R;
            n++;
        }
        switch(modNum){
        case 10:ans="A"+ans;break;
        case 11:ans="B"+ans;break;
        case 12:ans="C"+ans;break;
        case 13:ans="D"+ans;break;
        case 14:ans="E"+ans;break;
        case 15:ans="F"+ans;break;
        default:ans=to_string(modNum)+ans;break;
        }
    }

    ans=to_string(temp)+"="+ans+"(base"+to_string(R)+")";
    cout <<ans;
    return 0;
}