An H-packing of G is a collection of vertex-disjoint subgraphs of G such that each component is isomorphic to H.An H-packing of G is maximal if it cannot be extended to a larger H-packing of G.We consider problem of random allocation of a sequential resource into blocks of m consecutive units and show how it can be successfully modeled in terms of maximal Pm-packings.