Zxr960115 is owner of a large farm. He feeds *m* cute cats and employs *p* feeders. There's a straight road across the farm and *n* hills along the road, numbered from 1 to *n* from left to right. The distance between hill *i* and (*i* - 1) is *d*<sub class="lower-index">*i*</sub> meters. The feeders live in hill 1.

One day, the cats went out to play. Cat *i* went on a trip to hill *h*<sub class="lower-index">*i*</sub>, finished its trip at time *t*<sub class="lower-index">*i*</sub>, and then waited at hill *h*<sub class="lower-index">*i*</sub> for a feeder. The feeders must take all the cats. Each feeder goes straightly from hill 1 to *n* without waiting at a hill and takes all the waiting cats at each hill away. Feeders walk at a speed of 1 meter per unit time and are strong enough to take as many cats as they want.

For example, suppose we have two hills (*d*<sub class="lower-index">2</sub> = 1) and one cat that finished its trip at time 3 at hill 2 (*h*<sub class="lower-index">1</sub> = 2). Then if the feeder leaves hill 1 at time 2 or at time 3, he can take this cat, but if he leaves hill 1 at time 1 he can't take it. If the feeder leaves hill 1 at time 2, the cat waits him for 0 time units, if the feeder leaves hill 1 at time 3, the cat waits him for 1 time units.

Your task is to schedule the time leaving from hill 1 for each feeder so that the sum of the waiting time of all cats is minimized.
The first line of the input contains three integers *n*, *m*, *p* (2 ≤ *n* ≤ 10<sup class="upper-index">5</sup>, 1 ≤ *m* ≤ 10<sup class="upper-index">5</sup>, 1 ≤ *p* ≤ 100).

The second line contains *n* - 1 positive integers *d*<sub class="lower-index">2</sub>, *d*<sub class="lower-index">3</sub>, ..., *d*<sub class="lower-index">*n*</sub> (1 ≤ *d*<sub class="lower-index">*i*</sub> &lt; 10<sup class="upper-index">4</sup>).

Each of the next *m* lines contains two integers *h*<sub class="lower-index">*i*</sub> and *t*<sub class="lower-index">*i*</sub> (1 ≤ *h*<sub class="lower-index">*i*</sub> ≤ *n*, 0 ≤ *t*<sub class="lower-index">*i*</sub> ≤ 10<sup class="upper-index">9</sup>).
print("_RANDOM_GUESS_1689369648.168475")# 1689369648.168494