Lets start the numbering of characters in the string from $1$. The substring $S[i...j]$ is a sequence of characters that begins in position $i$ and ends in position $j$. For given indexes $i$ and $j$ print the length of substring and all the characters of this substring not violating their order in the string. \InputFile The first line contains string $S$, which length is no more than $100$. Second line contains two indexes $i$ and $j~(1 \le i \le j \le size(S)$, where $size(S)$ is the length of the string). \OutputFile In the first line print the length of the substring. In the second line print all characters of substring in the same order like in the string $S$.