S

def bruh(n, b):
    bruh.t = '0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ'
    r=''
    while n:
        n, y = divmod(n, b)
        r=bruh.t[y]+r
    return r


def universalConvertor(s, r):
    digits = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ"
    acc = 0
    for a in s:
        p = digits.find(a.upper())
        if (p >= r) | (p == -1):
            return None
        acc = acc * r + p
    return acc


s = input()
k, m = map(int, input().split())
if s[0] == '-':
    x = universalConvertor(s[1:], k)
    x = bruh(x, m)
    print("-" + str(x))
    exit()
x = universalConvertor(s, k)
x = bruh(x, m)
print(x)