We prove that two classes of communicative P systems with 3 membranes and with minimal cooperation, namely P systems with
symport/antiport rules of size 1 and and P systems with symport rules of size 2, are computationally complete: they generate
all recursively enumerable sets of vectors of nonnegative integers. The result of computation is obtained in the elementary
membrane.