从N块积木中选出若干块，并将它们分成M(1<=M<=N)堆，称为第1堆，第2堆，第3堆，…。每堆至少有1块积木，并且第K堆中任意一块积木的编号要大于第K+1堆中任意一块积木的编号(2<=K<=M)-selected from N building blocks in several pieces, and they are divided into M (1 <= M <= N) reactor, known as the first reactor, reactor No. 2, No. 3 reactor, .... Each pile has at least one building block and the first building block K heap any number greater than any of the first building block K+1 heap number (2 <= K <= M)