KöMaL 2026 C1917

We want to mark $k$ squares of a $2026\times 2026$ board with an $\times$ such that no two $\times$'s are in the same row or the same column. For which value of $k$ do we have the largest number of possibilities to do this? (The cases which can be reflected or rotated into each other are also considered to be different.)