Simon is very fascinated by the various coding problem. He continues to find many solutions for them. Once again, Simon has come up with another problem involving three integers A, B and N, output a...

Extracted text: Simon is very fascinated by the various coding problem. He continues to find many solutions for them. Once again, Simon has come up with another problem involving three integers A, B and N, output a permutation of [1,2,.,N] such that length of the longest increasing subsequence in the permutation is A and the length of the longest decreasing subsequence is B. Develop a C++ code to find N space separated integers, denoting the permutation of [1, 2, ., N]. If there doesn't exist no such permutation output -1. Input: 1 632 Output: 214365