Hint 1 : Consider any basis $(e_1,\cdots\,e_n)$ of $\mathbb{R}^n$ and try to obtain an upper bound for $\Vert T(x)\Vert$ in terms of $\Vert T(e_1)\vert$, ..., $\Vert T(e_1)\Vert$.
Hint 2 : For all $x\in\mathbb{R}^n$, there exist $x_1,\cdots,x_n\in\mathbb{R}$ such that $x=\sum_{i=1}^nx_ie_i$. Since $T$ is linear : $T(x)=\sum_{i=1}^nx_iT(e_i)$ and by triangle inequality :
$$\Vert T(x)\Vert\le\sum_{i=1}^n\vert x_i\vert\Vert T(e_i)\Vert$$
Here $\Vert y\Vert$ denotes the norm of a vector $y\in\mathbb{R}^m$ (how this norm is defined doesn't matter).
Let $M=\max\{\Vert T(e_i)\Vert;\,1\le i\le n\}$. Then we have :
$$\forall x\in\mathbb{R}^n,\,\Vert T(x)\Vert\le M\Vert x\Vert_1$$
where $\Vert \,\Vert_1$ denotes the norm defined on $\mathbb{R^n}$ by the sum of the absolute values of the coordinates relative to the basis $(e_1,\cdots,e_n)$.
It doesn't remain much work to reach the conclusion.