[guided]Our goal is to find the eigenvalues of $A$ explicitly. The standard technique for structured matrices arising from finite difference discretisations on rectangular grids is to guess a separable eigenvector — one whose $(i,j)$ entry factors as a function of $i$ alone times a function of $j$ alone. The natural candidates are products of sines, since the boundary conditions force the eigenvector to vanish at $i = 0$, $i = m+1$, $j = 0$, and $j = m+1$.
Since the [Equivalence of Orderings](/theorems/1366) shows that reordering grid points is an orthogonal conjugation $A^* = P^\top A P$ that preserves eigenvalues, we may work in the natural ordering without loss of generality.
For each pair $(k, \ell)$ with $k, \ell \in \{1, \ldots, m\}$, define the abbreviations $\alpha := k\pi h$ and $\beta := \ell\pi h$, and define the vector $v^{(k,\ell)} \in \mathbb{R}^{m^2}$ by assigning to the grid point $(i, j)$ the value
\begin{align*}
v_{i,j}^{(k,\ell)} := \sin(i\alpha)\sin(j\beta), \qquad i, j = 1, \ldots, m.
\end{align*}
Why sines specifically? The Dirichlet boundary condition $u = 0$ on $\partial\Omega$ means the eigenvector must vanish at $i = 0$, $i = m+1$, $j = 0$, and $j = m+1$. The function $\sin(i\alpha)$ vanishes at $i = 0$ automatically. At $i = m+1$, we have $\sin((m+1)\alpha) = \sin((m+1)k\pi h) = \sin(k\pi) = 0$ since $(m+1)h = 1$. The same holds for $\sin(j\beta)$. So the boundary conditions are satisfied by construction.
The vector $v^{(k,\ell)}$ is nonzero because for $i, j \in \{1, \ldots, m\}$, the arguments $i\alpha$ and $j\beta$ lie strictly between $0$ and $k\pi$ (resp. $\ell\pi$), and the sine function is positive on $(0, \pi)$. In particular, $v_{1,1}^{(k,\ell)} = \sin(\alpha)\sin(\beta) > 0$.[/guided]