Question
An ordering is supplied as a permutation of the letters. Decide whether the given word list is sorted according to that ordering.
```python
def solve(raw: str) -> str:
...
def run_case(case: dict) -> str:
return solve(case["stdin"])
```
## Requirements
- Line 1 is the word count; that many words follow one per line; the final line is the ordering, a permutation of the twenty-six lowercase letters.
- The final line is always the ordering, so the count line only says how many words precede it.
- Compare adjacent words left to right and stop at the first position where the letters differ; the letter ranked earlier wins.
- If one word is a proper prefix of the other, the shorter word must appear first.
- Return `true` or `false` in lowercase, with no other text.
- A single word satisfies the ordering without any comparison.
- Recovering an unknown ordering from the words is a different task and is out of scope.
- Do not append a trailing newline to the returned string; return the value exactly once.