## Beautiful combinatorical problem

There is integer number $m\geqslant 2$. Find the smallest integer number $n\geqslant m$, such that for every division of set $\lbrace m, m+1, ..., n\rbrace$ into two subsets at least one of thease subsets contains such numbers $a, b, c$ (not necessarily different), such that $ab=c$.