Base Conversion

Problem Description

Let's see who doesn't know base conversion — oh, it turns out to be me.

Given $n$ non-negative integers in different bases, compute their sum and output it in base $m$.

Use uppercase letters A ~ Z to represent $10$ ~ $35$, and lowercase letters a ~ z to represent $36$ ~ $61$.

Input Format

The first line contains two integers $1 \leq n \leq 10$ and $2 \leq m \leq 62$.

The next $n$ lines each contain an integer $2 \leq t \leq 62$ followed by a $t$-base number $0 \leq x \leq 10^9$.

Output Format

One $m$-base number, the final result.

Sample Input 1

2 2
2 1
6 10

Sample Output 1

111

Sample Input 2

1 10
52 aA0

Sample Output 2

97864

Sample Input 3

2 52
36 AMD
52 YES

Sample Output 3

dJD