Monochrome Minimization (Easy)

*This is the easy version of the problem. The only difference between this version and the hard version is the constraints: here, the sum of $N$ and the sum of $M$ across all tests both won't exceed $2000$.* There are $N+M$ points lying on the 2D coordinate plane. $N$ of these points lie on the positive $x$-axis (i.e. are of the form $(x, 0)$ for $x \gt 0$), and the other $M$ lie on the positive