$p-Clique ≤fpt p-WD_clique$. A graph becomes the structure with universe its vertices and one binary relation, its edges (listed from the adjacency matrix, so without repetition), and $k$ stays $k$. The witnesses of $clique(X)$ of weight $k$ are the $k$-cliques, the parameter is unchanged, and the map is computed by an IMP+ program in $O(|x|³)$ steps.