Hi after observing them for while I got the answer. I was doing one silly mistake
Here in above question none is CFL. Why?
Reason for 1:- Not CFL because we need two stacks (2 comparisons in the same language )
Reason for 2:- Again 2 stack needed One for a and b and another for c as {n>m}
Reason for 3:- When x will become w it will become CSL again more than 2 stacks needed which can be done by LBA or TM .
None is CFL.