Let $S$ be a finite semigroup with $k$ elements. If we have at least $(nk)^k$ elements $s_1, \ldots, s_m$, i.e. $m \ge (nk)^k$, then the product $$ s_1 \cdot s_2 \cdots s_m $$ could be factored as $s_1 \cdot s_2 \cdots s_m = xy_1 y_2 \cdots y_n z$ (i.e. the elements $x,y_i,z$ combine a consecutive subsequence and equal their product) such that the product $y_i y_{i+1} y_{i+j}$ is the same for every permissible $i$ and $j$.
Does anyone has an idea how to solve this? As $y_1 = \ldots = y_n$ and $y_i y_{i+1} = y_i$ the element must be an idempotent, but I do not know how to choose the factorisation/decomposition?