Problem: As we all know, Dart is some kind of creature from Upside Down world. For simplicity, we call their kind pollywogs. Dart and x - 1 other pollywogs are playing a game. There are n stones in a row, numbered from 1 through n from left to right. At most 1 pollywog may be sitting on each stone at a time. Initially, the pollywogs are sitting on the first x stones (one pollywog on each stone).

<image>

Dart and his friends want to end up on the last x stones. At each second, the leftmost pollywog should jump to the right. A pollywog can jump at most k stones; more specifically, a pollywog can jump from stone number i to stones i + 1, i + 2, ... i + k. A pollywog can't jump on an occupied stone. Jumping a distance i takes ci amounts of energy from the pollywog. 

Also, q stones are special Each time landing on a special stone p, takes wp amounts of energy (in addition to the energy for jump) from the pollywog. wp could be negative, in this case, it means the pollywog absorbs |wp| amounts of energy.

Pollywogs want to spend as little energy as possible (this value could be negative). 

They're just pollywogs, so they asked for your help. Tell them the total change in their energy, in case they move optimally.

Input

The first line of input contains four integers, x, k, n and q (1 ≤ x ≤ k ≤ 8, k ≤ n ≤ 108, 0 ≤ q ≤ min(25, n - x)) — the number of pollywogs, the maximum length of jump, the number of stones and the number of special stones.

The next line contains k integers, c1, c2, ... ck, separated by spaces (1 ≤ ci ≤ 109) — the energetic costs of jumps.

The next q lines contain description of the special stones. Each line contains two integers p and wp (x + 1 ≤ p ≤ n, |wp| ≤ 109). All p are distinct.

Output

Print the minimum amount of energy they need, in the first and only line of output.

Examples

Input

2 3 10 2
1 2 3
5 -10
6 1000


Output

6


Input

4 7 85 3
17 5 28 4 52 46 6
59 -76
33 -69
19 2018


Output

135

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int PMX = 26;
const long long inf = 0x3f3f3f3f3f3f3f3f;
int m, k, n, Q, q = 0, Mx, t = 0, now;
long long sum = 0;
int c[12], one[262], to[262], st[72];
struct aaa {
  int num;
  long long w;
} sp[202];
struct bbb {
  long long a[72][72];
} Mat[32], ans;
template <class T>
void read(T &x) {
  x = 0;
  int f = 0;
  char ch = getchar();
  while (ch < '0' || ch > '9') f |= (ch == '-'), ch = getchar();
  while (ch >= '0' && ch <= '9')
    x = (x << 3) + (x << 1) + (ch ^ 48), ch = getchar();
  x = f ? -x : x;
  return;
}
inline bool cmp(aaa a, aaa b) { return a.num < b.num ? 1 : 0; }
inline bbb mul(bbb a, bbb b) {
  bbb c;
  for (int i = 1; i <= t; ++i)
    for (int j = 1; j <= t; ++j) {
      c.a[i][j] = inf;
      for (int k = 1; k <= t; ++k)
        c.a[i][j] = min(c.a[i][j], a.a[i][k] + b.a[k][j]);
    }
  return c;
}
inline bbb Pow(int b) {
  bbb c = Mat[0];
  --b;
  for (int i = 0; i <= PMX; ++i)
    if ((b >> i) & 1) c = mul(c, Mat[i]);
  return c;
}
int main() {
  read(m), read(k), read(n), read(Q), Mx = (1 << k), now = 1;
  for (int i = 1; i < Mx; ++i) one[i] = one[(i >> 1)] + (i & 1);
  for (int i = 1; i <= k; ++i) read(c[i]);
  for (int i = 1; i <= Q; ++i) ++q, read(sp[q].num), read(sp[q].w);
  sort(sp + 1, sp + q + 1, cmp);
  for (int i = 0; i < Mx; ++i)
    if (one[i] == m) st[to[i] = (++t)] = i;
  for (int i = 1; i <= t; ++i)
    for (int j = 1; j <= t; ++j) Mat[0].a[i][j] = ans.a[i][j] = inf;
  for (int i = 1; i <= t; ++i) ans.a[i][i] = 0;
  for (int i = 1, l, w; i <= t; ++i) {
    l = ((st[i] << 1) & (Mx - 1));
    if (one[l] == m)
      Mat[0].a[i][to[l]] = 0;
    else
      for (int j = k - 1; ~j; --j)
        if (!((l >> j) & 1)) Mat[0].a[i][to[l | (1 << j)]] = c[k - j];
  }
  for (int i = 1; i <= PMX; ++i) Mat[i] = mul(Mat[i - 1], Mat[i - 1]);
  for (int i = 1; i <= q; ++i) {
    if (sp[i].num > n - m) {
      sum += sp[i].w;
      continue;
    }
    ans = mul(ans, Pow(sp[i].num - now)), now = sp[i].num;
    for (int j = 1; j <= t; ++j)
      for (int l = 1; l <= t; ++l)
        if ((st[l] >> (k - 1)) & 1) ans.a[j][l] += sp[i].w;
  }
  if (n - m + 1 - now > 0) ans = mul(ans, Pow(n - m + 1 - now));
  printf("%lld", ans.a[t][t] + sum);
  return 0;
}