import java.util.*;

public class Solution {

    /**

     * 进制转换

     * @param M int整型 给定整数

     * @param N int整型 转换到的进制

     * @return string字符串

     */

    public String solve (int M, int N) {

        boolean isNegative = false;

        if(M < 0) {

            isNegative = true;

            M = -M;

        }

        char[] map = {'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F'};

        StringBuilder sb = new StringBuilder();

        int remainder = 0;

        while(M != 0) {

            sb.insert(0, map[M % N]);

            M /= N;

        }

        String res = sb.toString();

        return isNegative ? "-" + res : res;

    }

}