Subarray Split (Easy)

*This is the easy version of the problem. The only difference between versions is the constraint on $N$. Here, $N \le 2000$ and the sum of $N^2$ across all tests both don't exceed $2000^2$.* You are given an array $A$ of length $N$ and an integer $K$. It is guaranteed that $0 \le A_i \lt K$ for each $1 \le i \le N$. You may perform the following operation **at most once**: - First, partition t