Pat-Level B-1048 Digital Encryption

This question requires a digital encryption method. First, fix an encryption using a positive integer A. For any positive integer B, perform the following operations on each digit and the number at the corresponding position of A: For odd digits, after the numbers of the corresponding bits are added, the remainder of 13 is obtained. Here, j Represents 10, Q represents 11, and K represents 12. The dual digit is subtracted from the number of A by the number of B, if the result is negative, add 10. Here, the single digit is 1st bits.

Input Format:

The input values are given in sequence as A and B in a row. They are positive integers of no more than 100 bits, separated by spaces.

Output Format:

Output the encrypted result in a row.

Input example:

1234567 368782971

Output example:

20175q8118

Pat-Level B-1048 Digital Encryption