{"problem":{"name":"Route Map","description":{"content":"There are $N$ stations on a certain line operated by AtCoder Railway. The $i$\\-th station $(1 \\leq i \\leq N)$ from the starting station is named $S_i$. Local trains stop at all stations, while express","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc236_c"},"statements":[{"statement_type":"Markdown","content":"There are $N$ stations on a certain line operated by AtCoder Railway. The $i$\\-th station $(1 \\leq i \\leq N)$ from the starting station is named $S_i$.\nLocal trains stop at all stations, while express trains may not. Specifically, express trains stop at only $M \\, (M \\leq N)$ stations, and the $j$\\-th stop $(1 \\leq j \\leq M)$ is the station named $T_j$.  \nHere, it is guaranteed that $T_1 = S_1$ and $T_M = S_N$, that is, express trains stop at both starting and terminal stations.\nFor each of the $N$ stations, determine whether express trains stop at that station.\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$N$ $M$\n$S_1$ $\\ldots$ $S_N$\n$T_1$ $\\ldots$ $T_M$\n\n## Constrains\n\n*   $2 \\leq M \\leq N \\leq 10^5$\n*   $N$ and $M$ are integers.\n*   $S_i$ $(1 \\leq i \\leq N)$ is a string of length between $1$ and $10$ (inclusive) consisting of lowercase English letters.\n*   $S_i \\neq S_j \\, (i \\neq j)$\n*   $T_1 = S_1$ and $T_M = S_N$.\n*   $(T_1, \\dots, T_M)$ is obtained by removing zero or more strings from $(S_1, \\dots, S_N)$ and lining up the remaining strings without changing the order.\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc236_c","tags":[],"sample_group":[["5 3\ntokyo kanda akiba okachi ueno\ntokyo akiba ueno","Yes\nNo\nYes\nNo\nYes"],["7 7\na t c o d e r\na t c o d e r","Yes\nYes\nYes\nYes\nYes\nYes\nYes\n\nExpress trains may stop at all stations."]],"created_at":"2026-03-03 11:01:14"}}