I'm trying to construct a context-free grammar for the language $L = \{a^m!a^n : n > 0, m > 0, n > m\}$, but I'm not sure how to ensure that the right trail of $a$s is longer than the left one.
Is there a way I could include the left side in the right side using context-free grammar?