LCM proof using division algorithm?

I need help to prove if a|m and b|m, then [a,b]|m. I'm supposed to let l = [a,b] and by using division algorithm, I need to show that r is a common multiple of a and b,and deduce that r = 0. Thanks!