The M-K-N-Y problem is to get N>0 packages delivered, using M>0 vehicles in Y dimensions (1,2,3).A vehicle can carry upto K>0 packages at a time