Sereja and Transformation

Problem Statement - Sereja has a sequence of n integers a[1], a[2], ..., a[n]. Sereja can do following transformation of the array: create a new sequence of n integers b[1], b[2], ..., b[n]in this way: (1 ≤ i ≤ n) Replace the sequence a by b, i.e., a[i] = b[i] for all i in [1, n] Sereja decided to use his transformation k times. Then he computed the value of , where r — the sequence obtained