On the structure complexity of closed classes containing some specific classes of monotone $k$-valued functions

We consider closed classes of monotone functions in multivalued logic with respect to partially ordered sets that have a unique minimal element and two maximal elements or a unique maximal element and two minimal elements. We prove that any such class is either pre-precomplete or contained in an infinite number of closed classes, which have no predicate description.