Page "Arthur–Merlin protocol" Paragraph 3

Formally, the complexity class MA is the set of decision problems that can be decided in polynomial time by an Arthur – Merlin protocol where Merlin's only move precedes any computation by Arthur.

In other words, a language L is in MA if there exists a polynomial-time deterministic Turing machine M and polynomials p, q such that for every input string x of length n