Formal languages and autoamata question.

Decidability / Undecidability Determine whether the following languages are decidable or undecidable and prove your claim.

QUADTM= { |M1, M2, M3 and M4 are TMs such that Vij: M; accepts }