{"problem":{"name":"Stamp","description":{"content":"You are given two strings: $S$, which consists of uppercase English letters and has length $N$, and $T$, which also consists of uppercase English letters and has length $M\\ (\\leq N)$. There is a strin","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc329_e"},"statements":[{"statement_type":"Markdown","content":"You are given two strings: $S$, which consists of uppercase English letters and has length $N$, and $T$, which also consists of uppercase English letters and has length $M\\ (\\leq N)$.\nThere is a string $X$ of length $N$ consisting only of the character `#`. Determine whether it is possible to make $X$ match $S$ by performing the following operation any number of times:\n\n*   Choose $M$ consecutive characters in $X$ and replace them with $T$.\n\n## Constraints\n\n*   $1 \\leq N \\leq 2\\times 10^5$\n*   $1 \\leq M \\leq \\min(N,$ $5$$)$\n*   $S$ is a string consisting of uppercase English letters with length $N$.\n*   $T$ is a string consisting of uppercase English letters with length $M$.\n\n## Input\n\nThe input is given from Standard Input in the following format:\n\n$N$ $M$\n$S$\n$T$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc329_e","tags":[],"sample_group":[["7 3\nABCBABC\nABC","Yes\n\nBelow, let $X[l:r]$ denote the part from the $l$\\-th through the $r$\\-th character of $X$.\nYou can make $X$ match $S$ by operating as follows.\n\n1.  Replace $X[3:5]$ with $T$. $X$ becomes `##ABC##`.\n2.  Replace $X[1:3]$ with $T$. $X$ becomes `ABCBC##`.\n3.  Replace $X[5:7]$ with $T$. $X$ becomes `ABCBABC`."],["7 3\nABBCABC\nABC","No\n\nNo matter how you operate, it is impossible to make $X$ match $S$."],["12 2\nXYXXYXXYYYXY\nXY","Yes"]],"created_at":"2026-03-03 11:01:14"}}