KöMaL 2019 A740

A $k\times k$ array contains each of the numbers $1,2,\ldots,m$ exactly once, with the remaining entries all zero. Suppose that all the row sums and column sums are equal. What is the smallest possible value of $m$ if $k=3^n$ ($n\in\mathbb{N^+}$)?