{"trustable":true,"sections":[{"title":"","value":{"format":"HTML","content":"\u003cp\u003eGive a string $S$ and $N$ string $T_i$ , determine whether $T_i$ is a subsequence of $S$.\u003c/p\u003e\n\u003cp\u003eIf ti is subsequence of $S$, print \u003ccode\u003eYES\u003c/code\u003e,else print \u003ccode\u003eNO\u003c/code\u003e.\u003c/p\u003e\n\u003cp\u003eIf there is an array $\\lbrace K_1, K_2, K_3,\\cdots, K_m \\rbrace$ so that $1 \\le K_1 \u0026lt; K_2 \u0026lt; K_3 \u0026lt; \\cdots \u0026lt; K_m \\le N$ and $S_{k_i} \u003d T_i$, $(1 \\le i \\le m)$, then $T_i$ is a subsequence of $S$.\u003c/p\u003e\n\u003ch3 id\u003d\"input\"\u003eInput\u003c/h3\u003e\n\u003cp\u003eThe first line is one string $S$,length($S$) $ \\le 100000$\u003c/p\u003e\n\u003cp\u003eThe second line is one positive integer $N,N \\le 100000$\u003c/p\u003e\n\u003cp\u003eThen next $n$ lines,every line is a string $T_i$, length($T_i$) $\\le 1000$\u003c/p\u003e\n\u003ch3 id\u003d\"output\"\u003eOutput\u003c/h3\u003e\n\u003cp\u003ePrint $N$ lines. If the $i$-th $T_i$ is subsequence of $S$, print \u003ccode\u003eYES\u003c/code\u003e, else print \u003ccode\u003eNO\u003c/code\u003e.\u003c/p\u003e"}},{"title":"Sample 1","value":{"format":"HTML","content":"\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003eabcdefg\n3\nabc\nadg\ncba\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003eYES\nYES\nNO\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n\u003cbr /\u003e"}}]}