$p-Dominating-Set ≤fpt p-Hitting-Set$, by closed neighbourhoods. The universe is the vertex set, set $v$ is $N[v] = {v} ∪ N(v)$, and the solution size is unchanged: a set of $k$ vertices dominates the graph exactly when it meets every closed neighbourhood. Each set is written sorted and without repetitions by testing the candidates $0, …, n-1$ in order against the adjacency block of $v$, so the order and repetitions of the block do not matter. The parameter is unchanged, and an IMP+ program computes the reduction within $20000 (|x| + 1)^3$ steps.