$n$ students want to equally partition $m$ identical cakes between themselves. What’s the minimal number of pieces of cake one has to cut, so that the upper condition is satisfied? Each cut increases the number of pieces by 1.