You are given two strings, stamp and target. Initially, a string s of length target.length contains only question mark characters ('?').

In one turn, you may place stamp over s at an index $i$ such that $0 \le i \le \text{target.length} - \text{stamp.length}$, overwriting stamp.length consecutive characters of s with the characters from stamp.

Return an array containing the starting indices of the stamp applied in each turn to transform s into target. If target cannot be formed within $10 \times \text{target.length}$ turns, return an empty array. If there are multiple answers, return any of them.

Constraints:

• $1 \le$ stamp.length $\le$ target.length $\le 1000$

• stamp and target consist of lowercase English letters.

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.