Every computer language has different string functions and many have a different method of finding a substring. For this program you will be asked to code the algorithm that replicates the string function SUBSTR (string, start, length) as defined below:

INPUT FORMAT

There will be 6 lines of input (there are 9 shown here for extra examples). The first line will be a character string of fewer than 100 characters. The remaining lines will each have 2 integers representing the start and length values of the function parameters.

OUTPUT FORMAT

For each set of parameter values, print the substring produced. We guarantee that the first and/or last outputted character will not be a space. We also guarantee that each substring will be valid.

SAMPLE

INPUT

Hello world!
0, 10
1, 8
0, 5
6, 6
0, -1
-10, -2
0, -5
-4, 0

OUTPUT

Hello worl
ello wor
Hello
world!
Hello world
llo worl
Hello w
rld!