Design a Turing machine that, starting with the tape will eventually halt on the leftmost stroke on the tape, which is now to contain a block of n strokes, followed by a blank, followed by a block of m$-1$ strokes, followed by a blank, followed by a block of k strokes.