The security office at a research campus scans every employee badge as a string of digits, each digit from 1 to 9 (the scanner never produces a 0). A known hardware fault means exactly one keystroke of a specific flagged digit must be struck from the scanned code before the turnstile will accept it — the office may choose which occurrence of that digit to strike, and the remaining digits keep their original left-to-right order to form the accepted code. Since striking one digit always leaves a code with exactly one fewer digit no matter which occurrence is chosen, the accepted code with the largest possible numeric value is simply the one that compares largest as a string of that same length. Determine the largest accepted code the office can produce.

Input format

• Line 1: a string number of digits, each in the range 1-9.
• Line 2: a single character digit (also in the range 1-9) that occurs at least once in number.

Output format

Print the resulting string after striking exactly one occurrence of digit from number, chosen so the remaining string is as large as possible.

Constraints

• 2 <= length of number <= 100
• Every character of number is a digit from 1 to 9 (never 0)
• digit is a single character from 1 to 9 and appears at least once in number

5273
2

573

4353
3

453