Smallest String After Removing One Character

Given a string (s) containing only lowercase English letters, remove exactly one character from (s) to produce a new string. Your task is to determine the lexicographically smallest string that can be formed by such a removal.

For example, if (s = ) "leetcode", removing the first character yields "eetcode", which is the smallest possible result compared to removing any other character.

Note: The lexicographical order is defined as the usual dictionary order.

inputFormat

A single line containing the string (s). The string consists of only lowercase English letters and has a length of at least 1.

outputFormat

Output the lexicographically smallest string possible after removing exactly one character from the input string.## sample

abc

ab