Added note on type (n, m, p) instances that the general case is in NP-complete, stated as a formal theorem, given that we've proven they're in NP-hard and they're obviously in NP.