Question
Given a text and a small dictionary, decide whether the whole text can be written as a sequence of dictionary words, reusing a word as often as needed.
```python
def solve(raw: str) -> str:
...
def run_case(case: dict) -> str:
return solve(case["stdin"])
```
## Requirements
- Line 1 is the text; line 2 is how many dictionary words follow, one per line.
- Some inputs carry the two characters backslash and `n` instead of real line breaks; treat both forms as line separators before parsing.
- Every character of the text must be covered in order by whole dictionary words; nothing may be skipped or reordered.
- Words may be reused, and a word may be shorter than the remaining text but must match exactly at the current position.
- Return `true` or `false` in lowercase, with no other text.
- Return `false` when no arrangement covers the entire text, including when the text ends inside a word.
- Prefer marking reachable positions over re-joining the same prefix many times, because the text can be long.
- Do not append a trailing newline to the returned string; return the value exactly once.