A trader owns horses of $3$ races, and exacly $b_j$ of each race (for $j=1,2,3$). He want to leave these horses heritage to his $3$ sons. He knowns that the boy $i$ for horse $j$ (for $i,j=1,2,3$) would pay $a_{ij}$ golds, such that for distinct $i,j$ holds holds $a_{ii}> a_{ij}$ and $a_{jj} >a_{ij}$. Prove that there exists a natural number $n$ such that whenever it holds $\min\{b_1,b_2,b_3\}>n$, trader can give the horses to their sons such that after getting the horses each son values his horses more than the other brother is getting, individually.