  We introduce a combinatorial enumeration problem that is solved using
generalized Catalan numbers. We also study generalizations of the Cycle Lemma
beyond the computation of the generalized Catalan numbers.
