Turing Machine that triples a unary format number?
Copy the number once (as you have done already). Mark the spot between the original and the copy with a new letter. Now run again the copy, but stop copying once you see the letter $\land$.
That is, copy $\land 111\land$ into $\land 111 \#  111 \land $. Now copy again, while thinking of $\#$ as the new beginning of the tape. You will get $\land 111 \# 111 \# 111 \land$. After that, replace all $\#$ with $\land$ to get: $\land 111\land 111\land 111\land$
Notice that this process can be done any number of times, meaning that you can clone the input any number of times you would like!

Also, as a general &quot;trick&quot; for such problems, try introducing either a new letter to the alphabet (it usually helps create edge cases that you need to solve), or to meddle with an existing machine's states (such as adding an index into their states, etc')