Problem Statement  
A permutation p[0], p[1], ..., p[n1] is a sequence containing each number from 0 to n1 exactly once. The result of applying permutation p to an array a of length n is an array b of length n, where b[p[i]] = a[i] (0based indices).
Given an array a, find a permutation which has the effect of sorting the elements of a in nondescending order, i.e., an order where each element is greater than or equal to the previous one. If there are several suitable permutations return the lexicographically smallest one. The permutation p[0], p[1], ..., p[n1] is considered lexicographically smaller than the permutation q[0], q[1], ..., q[n1] if there is an index i such that p[i] < q[i] and the equation p[j] = q[j] holds for all j < i.  
Definition  
 
Constraints  
  a will contain between 1 and 50 elements, inclusive.  
  Each element of a will be between 1 and 1000, inclusive.  
Examples  
0)  
 
1)  
 
2)  
