CMO 1994 Problem 2

There are $m$ pieces of candy held in $n$ trays( $n,m\ge 4$ ). An operation is defined as follow: take out one piece of candy from any two trays respectively, then put them in a third tray. Determine, with proof, if we can move all candies to a single tray by finite operations.