One square is coloured red at random on an 8×8 grid. Show that no matter where this red square is, you can cover the remaining 63 squares with 21 ‘L’ triominoes, with no gaps or overlaps.