KöMaL 2018 B4934

For any positive integers $n$ and $k$, let $f(n,k)$ denote the number of unit squares cut in two by a diagonal of an $n\times k$ lattice rectangle. How many number pairs $n$, $k$ are there such that $n\ge k$, and $f(n,k)=2018$?