Detect any contiguous run with a target sum

Question

Given an integer array and a target, decide whether some non-empty contiguous run adds up to exactly that target.

```python
def solve(raw: str) -> str:
    ...


def run_case(case: dict) -> str:
    return solve(case["stdin"])
```

## Requirements

- The first line holds the element count and the target, separated by a space; the second line holds the values.
- Return `True` when at least one such run exists and `False` otherwise, with exactly that capitalization and no other text.
- Values may be negative or zero, so a partial sum that drifts away from the target is not evidence that no run exists.
- A single element equal to the target counts, and a run may include zero-valued elements.
- Stop as soon as a match is found; later runs do not change the answer.
- Return a `str`, not a `bool`, so the value survives being written to output.
- Do not append a trailing newline to the returned string; return the value exactly once.