p-Clique ≤fpt Multicoloured Clique. For $k ≤ n$, take $k$ copies of the vertex set, the copy $c$ coloured $c$, and join $(c, u)$ and $(c', v)$ when $c ≠ c'$ and $uv$ is an edge; a multicoloured clique picks $k$ distinct pairwise adjacent vertices, and conversely. For $k > n$ the word of a fixed no-instance (one colour, no vertices) is written. The number of colours is at most $k$, and the map is computed in polynomial time.