Suppose $\phi_k$ are polynomials of degree $<m$.
For all linear combinations $(c_k)$ of the columns:
Let $q=\sum_k c_k\phi_k$.
$$\sum_k c_k\left(\array{\phi_k(x_1)\\\phi_k(x_2)\\\vdots\\\phi_k(x_m)}\right)=0\implies \left(\array{q(x_1)\\q(x_2)\\\vdots\\q(x_m)}\right)=0\implies q=0\implies(c_k)=(0)$$
So the columns are linearly independent.
Otherwise, let $(a_{k,j})_{n\times n}$ be an invertible matrix, and $M$ bigger than all $x_j$.
Let $\phi_k$ be curves (even polynomials of degree $m$) each passing through all the points $(x_j,0)\forall j=1,\ldots,m+1-n$ and also $(M+j,a_{k,j})\forall j=1,\ldots,n$. It is easy to see that they are "linearly independent", but the matrix will have at least $m+1-n$ zero rows, and have a rank of at most $m-(m+1-n)=n-1$, so the columns are linearly dependent.