A transportation BFS has at most $m+n-1$ basic variables

Let there be $m$ origins, $i$th origin possessing $a_i$ units of a certain item, whereas there are $n$ destinations with $j$th destination requiring $b_j$ units in a transportation problem, then the number of basic variables are at the most: