Look at the following proof of the Noether Normalization Lemma taken from Qing Liu's book "Algebraic Geometry and Arithmetic Curves":

I don't understand the highlighted part. To be more specific, I don't have any idea how to find the vector $m\in\mathbb N^n$ such that $\left<m,\nu_0\right> > \left<m,\nu\right>$ for every $\nu_0\neq \nu$ with $\alpha_\nu\neq 0$.
Thanks in advance.
You could take $m = (d^{n-1},d^{n-2},\ldots,d,1)$ where $d-1$ is the largest digit appearing among the indices $\nu$. For this $m$, the scalar product $\langle m,\nu\rangle$ is the number whose base-$d$ representation is the string $\nu$, and so $\langle m,\nu\rangle>\langle m,\nu'\rangle$ precisely when $\nu$ is greater than $\nu'$ in the lexicographical order.