A sorting depot's conveyor belt can only lift parcels from the incoming chute in fixed batches of exactly 4 (or fewer, once the chute is nearly empty) into a small staging tray. A sequence of downstream stations, one after another, each ask the tray operator to hand over a specific number of parcels. Any parcels already lifted into the tray but not yet handed to a station must be kept for the next request rather than re-lifted or discarded, and once the chute runs dry every later station gets fewer parcels than it asked for (possibly none). Simulate the full sequence of station requests, in order, against one shared chute.

Input format

Line 1: a string S — the chute's contents from front to back, using only lowercase letters and digits (0 <= |S| <= 10^4). This line may be empty. Line 2: an integer q — the number of station requests that follow (1 <= q <= 1000). Next q lines: one integer n_i per line — the number of parcels station i asks for (0 <= n_i <= 10^4).

Output format

Print q lines, one per station request, in order. Each line has the form k:chars, where k is the number of parcels actually handed to that station (fewer than requested once the chute is exhausted) and chars is those parcels' characters concatenated in original order (empty if k is 0).

Constraints

• 0 <= |S| <= 10^4, S contains only [a-z0-9]
• 1 <= q <= 1000
• 0 <= n_i <= 10^4

parceldepot12
3
4
5
10

4:parc
5:eldep
4:ot12

abc
4
2
5
1
3

2:ab
1:c
0:
0: