More precisely, suppose this sequence is a sequence of IDs that M enters starting with the initial ID with input W. Then any solution to the constructed NPCP instance will yield a pair of strings that begin a sequence of IDs, separated by pound signs. 