The polynomial dichotomy for three nonempty part sandwich problems 1

We classify into polynomial time or NP-complete all three nonempty part sandwich problems. This solves the polynomial dichotomy for this class of problems.