@rockyicer As you likely realize, what you're currently asking about has nothing to do with the mathematical aspects of the solution. Rather, I did it solely for the display aspect, to put the variables back the way that you originally had them.
Before I give a more-thorough Answer, tell me which (if any) of these Maple commands you already have a basic understanding of: type, indets, subsindets, cat, op, op(0, ...).
In my command above, patindex(anything) is the type of subexpression to be changed. The pat stands for "patterned" (which I think you figured out already). So, it looks for indexed expressions with a certain type pattern in the indices. But, since I specifed anything, it'll match any indexed expression. So, I could've (and for sake of simplicity, I should've) used indexed instead of patindex(anything). See the help pages ?type, ?type,structure (for patindex), ?type,anything, ?indexed, ?type,indexed.
Supposed that n is an indexed name, for example n = x[1,2]. Then op(0, n) = x, op(n) = (1, 2), and op(0.., n) = (x, 1, 2). (There's a distinction between indexed and subscripted. Subscripted refers to the form of typographic display of an expression, but indexed refers to its internally stored structure.) The op stands for "operands". It's the most-fundamental Maple command for deconstructing expressions. See ?op and ?name.
The cat stands for "catenate". It's the Maple command for building symbols and strings. So, using the same n as above, the cat command becomes cat(x, (1, 2)) ==> cat(x, 1, 2) ==> x12. See ?cat.
Regarding the length and complexity of my command: It could be replaced with
S:= simplify(solve(Eqs, Svars)); #Do the algebra.
subsindets(S, indexed, 0.., cat@op); #Do the typography.
The  after subsindets causes the indexed subexpressions to be passed as the 2nd argument to the transformer, cat@op, with 0.. being its (constant) 1st argument. See ?subsindets.