Context-sensitive grammars without permutation rules
You have the Koruda normal form in mind. It is indeed often useful, in particular in simulation LBAs. 

However, many definitions of CSGs (including Chomsky's) are different; they require rules to have the form

$\qquad \alpha A \beta \to \alpha \gamma \beta$.

You can see how this precludes "permutation rules".

Obtain a concrete grammar by applying the simulation you find in a proof that KNF is equivalent to the classical definition.