Let A be the set of all permutations a=(a1,a2,…,a2003) of the 2003 first positive integers such that each permutation satisfies the condition: there is no proper subset S of the set {1,2,…,2003} such that {ak∣k∈S}=S.
For each a=(a1,a2,…,a , let
I. Find the least value of d(a) . Denote this least value by d0 .
II. Find all permutations a∈A such that .