This is an interactive problem.

You are given two strings $$$A$$$ and $$$B$$$, consisting of lowercase English letters and free positions represented by dots. Your task is to transform string $$$A$$$ into string $$$B$$$ using a sequence of operations that can be applied to $$$A$$$. The following operations are available:

• Copy the character at position $$$i$$$ to a randomly chosen uniformly at random free position.
• Erase the character at position $$$i$$$, freeing up position $$$i$$$.

Both strings have length $$$N$$$ (where $$$10 \leq N \leq 50$$$), and they consist of lowercase English letters and dots. The dots represent free positions.

For given strings there exists an algorithm that will transform string $$$A$$$ into string $$$B$$$ in no more than $$$1\,000$$$ operations.

Initially, the judging program will output two strings. After that, for each participant's query, the judging program will execute it and return the result. If string $$$A$$$ matches string $$$B$$$, the judging program will prompt the participant's program to terminate. After that, the participant's program must terminate as well.

Each query must be of the following format:

• "dup $$$i$$$" — copy the character located at position $$$i$$$ ($$$1 \leq i \leq N$$$). There must be a character at position $$$i$$$ and free positions in the string before making this query.
• "clr $$$i$$$" — erase the character located at position $$$i$$$ ($$$1 \leq i \leq N$$$). There must be a character at position $$$i$$$ before this query.

The subsequent lines contain a single integer—result of processing the participant's query. The result is "$$$-1$$$" if string $$$A$$$ matches string $$$B$$$; otherwise:

• For the dup query: the position where the symbol was copied.
• For the clr query: the number $$$0$$$.

The number of queries must not exceed $$$1\,000$$$.