Clique reduces to SAT $*$

Let $G=(V,E)$ be a graph. A clique is a subset QsubeV of vertices such that any two distinct

vertices in $Q$ are connected by an edge in $G.$ The size of a clique $Q$ is the number $|Q|$ of vertices

in $Q.$

Show that Clique ${?}_P^m$ SAT.

$($SAT is the same as $3$SAT, except we permit any number of distinct literals in each clause.$)$