Constructing Turing Machine with Jflap

Construct a deterministic one way infinite single tape Turing machine that accepts {(xy)^n x^m z^m| n,m>+0, m < n} You may not make use of the fact that JFLAP has blank spaces to the left of the input. And you may not use blocks or the stay directive (each transition must either move the read/write head left or right) for this Turing machine. Since JFLAP does not specifically have a reject state, you can either have a state that you transition to that reads the rest of the input and does not accept (basically equivalent to a reject state, but it does not reject until reading all of the input) or you can simply leave off invalid transitions, which will cause your Turing machine to reject the input. Instructor's machine has 28 states.