Nana7mi has a string sss with length of nnn and containing only lowercase characters. Now she wants to know the lexicographically greatest string ttt with length not exceed mmm, containing only lowercase characters and is lexicographically less than sss. String xxx is lexicographically less than string yyy, if either xxx is a prefix of yyy , or there exists such i(1≤i≤min(∣x∣,∣y∣)i (1 le i le min(|x|,|y|)i(1≤i≤min(∣x∣,∣y∣)), that xi
Nana7mi has a string sss with length of nnn and containing only lowercase characters. Now she wants to know the lexicographically greatest string ttt with length not exceed mmm, containing only lowercase characters and is lexicographically less than sss. String xxx is lexicographically less than string yyy, if either xxx is a prefix of yyy (and x≠yx neq yx=y), or there exists such i(1≤i≤min(∣x∣,∣y∣)i (1 le i le min(|x|,|y|)i(1≤i≤min(∣x∣,∣y∣)), that xi