Grammar generating specific language
Hint. Can you figure out a regular grammar such that for any $k, m, n$ with $k &gt; n$ and $k &gt; m$, there is a word in its language with that number of a, b and c (in any order)?

Hint. Did you know that you can sort with a context sensitive grammar? See an example for inspiration.