eolymp
bolt
Try our new interface for solving problems

A-B

Time limit 1 second
Memory limit 64 MiB

Consider a set of strings consisting only of decimal digits, or letters of the alphabet of both registers. Two lines will be assumed to be similar if they have the same length and, in addition, at the same positions are the symbols of the same category, provided that such categories have 3 - all digits, letters and small letters case of a large register.

For each set consisting of something like that, is introduced to subtract. We order all the lines like this in the lexicographic order, then number them, starting from scratch. The result of subtraction from line A line B will assume a certain line of C, satisfying:

N(C)=(N(A)-N(B)) mod M,

where M - total number of lines like this, N(A), N(B) and N(C) - respectively the row numbers A, B and C, and the mod operation is common sense in mathematics - that is, is the smallest non-negative number to be subtracted from the second operand, so that it becomes a multiple of the first.

Input data

The first line of input contains A, and second - contains B. It is guaranteed that A and B are similar, and their length is at least 1 and no more than 500000.

Output data

In the output a single line - the answer of the problem (C).

Examples

Input example #1
7
3
Output example #1
4