A remote weather station streams each hour's sensor readings as one long line of letters and digits, but a firmware bug on the transmitter drops every space character before the line leaves the device, leaving one unbroken run of characters. A ground-station engineer has already figured out, by cross-referencing the station's field-width table, the exact character positions (0-indexed offsets into the original, space-free string) at which a single space must be reinserted to recover the readable log line. You are given the space-free string and the strictly increasing list of positions. For each position p in the list, a single space must appear immediately before the character that was at index p in the original string (all positions refer to offsets in the original string, never to positions in the growing output). Reconstruct and print the readable line.

Input format

A single line (or equivalently, whitespace-separated tokens) containing:

• n — the length of the original string
• s — the original string, exactly n characters, containing only lowercase English letters and digits (no whitespace)
• m — the number of positions where a space must be inserted
• m integers p_1 < p_2 < ... < p_m, strictly increasing, each satisfying 1 <= p_i <= n-1

Output format

Print a single line: the string s with a space inserted immediately before index p_i for every i, for the original indices (spaces do not shift subsequent position references).

Constraints

• 1 <= n <= 300000
• 0 <= m <= n-1
• 1 <= p_i <= n-1, strictly increasing
• s consists only of lowercase English letters and digits

10 helloworld 1 5

hello world

16 thequickbrownfox 3 3 8 13

the quick brown fox