Two universal 3-quantifier representations of recursively enumerable sets

It is proved that all recursively enumerable sets of natural numbers can be represented by arithmetic formulas (of two kinds) with only 3 quantifiers.