PCP: Post's Correspondence Problem

We know that PCP is undecideable.

W | W is an instance of PCP with some m pieces and a match can be created by lining up at most m4 pieces }. Show that Q is in NP. W | W is an instance of PCP with some m pieces and a match can be created by lining up at most m4 pieces }. Show that Q is in NP