Problem: F --Dangerous Delivery

Story

Person D had a serious mission. It is to deliver the next DAtaCoDer Regular Contest (DARC) D problem to Mr. Dhokudai, the president of DAtaCoDer. N cities are lined up in a straight line from city 1 where D's hideout is located to city N where the DAtaCoDer headquarters is located. During this move, a group of green triangles plotting injustice are aiming for the D problem, and they must protect the D problem from their devil's hands.

Fortunately, D's person has the ability to move across dimensional walls, so it's not easy to get caught. However, this movement method has some drawbacks. First of all, there is a gap when you start moving, and when you find that moment, you will find yourself at the destination. The green triangles continue to monitor each of them overlooking multiple cities. Moreover, reading the movement of the person in D, it seems that he is gradually moving in the direction of city N. Therefore, traveling from a city monitored by many green triangles or traveling a long distance increases the risk of discovery. The second drawback is that moving across a dimensional wall puts a strain on the body and can only be used once a day. It is also necessary to consider the pace distribution so that it will be in time for D days after the next DARC is held. It is unlikely that D's person will be captured like a green triangle, but the cautious D's person sought to minimize the risk of moving from City 1 to City N by D days later.

Problem

There are N cities on a two-dimensional plane. Cities 1 to N are aligned from left to right, and city i is in position (p_i, 0). Satisfy p_i <p_ {i + 1} (1 \ leq i <N).

In addition, there are M enemies on this two-dimensional plane, and the enemy j is initially in the position (a_j, b_j). Enemy j is watching the range of 45 ° up and down in the left direction. That is, all cities included in the area above the straight line y = x-a_j + b_j and below the straight line y = -x + a_j + b_j are in sight. Also, all enemies move to the right by exactly X every day. That is, the position of the enemy j on the dth day is (a_j + X (d-1), b_j).

Here, the degree of surveillance w_ {d, i} of the city i on the d day is defined by the total number of enemies who have the city i in sight on the d day. At this time, the movement from city i to city k on day d bears the risk of w_ {d, i} \ times | p_i-p_k |. If you can only move once a day, minimize the total risk of moving from city 1 to city N by D days later.

Input

The input consists of the following format.


N M D X
p_1 p_2 ... p_N
a_1 b_1
...
a_M b_M

The first line consists of four integers, and the number of cities N, the number of enemies M, the upper limit D of the number of days that can be moved, and the movement distance X of enemies per day are given, each separated by one blank character. The second line consists of N integers, and the i-th integer is given the x-coordinate p_i of the position of the city i, separated by a single character. The following M line is given the position information of the enemy. The second line of j + (1 \ leq j \ leq M) consists of two integers, and the x-coordinate a_j and y-coordinate b_j of the position of the enemy j on the first day are given by separating them with one blank character.

Constraints:

* 1 \ leq N \ leq 10 ^ 4
* 1 \ leq M \ leq 10 ^ 4
* 1 \ leq D \ leq 10 ^ 2
* 1 \ leq X \ leq 10 ^ 6
* 0 \ leq p_i, a_j \ leq 10 ^ 6, -10 ^ 6 \ leq b_j \ leq 10 ^ 6
* p_i <p_ {i + 1}



Output

Output the minimum sum of risks for being in city N by day D on one line. Be sure to start a new line at the end of the line.

Sample Input 1


3 2 2 1
0 3 6
1 1
3 -2

Sample Output 1


6

DangerousDelivery_sample1-1.png DangerousDelivery_sample1-2.png

On the first day, city 1 is monitored by 2 people, city 2 by 0 people, and city 3 by 0 people. Similarly, on the second day, city 1 is monitored by 2 people, city 2 by 0 people, and city 3 by 0 people. Therefore, on the first day, moving from city 1 to city 2 has a risk of 2 \ times | 3-0 | = 6, and on the second day, moving from city 2 to city 3 has a risk of 0 \ times | 6-3. The total of 6 of | = 0 is the minimum.

Sample Input 2


3 2 2 1
0 3 6
twenty one
3 -1

Sample Output 2


9

DangerousDelivery_sample2-1.png DangerousDelivery_sample2-2.png

The method of movement is the same as the first sample, but on the second day, the cost changes to 1 \ times | 6-3 | = 3 because the number of guards in city 2 increases by 1 due to the movement of the enemy. Therefore, the minimum risk is 9.

Sample Input 3


10 8 5 3
0 8 10 13 17 20 21 29 30 45
18 2
50 -20
17 1
38 21
40 -11
0 0
0 0
22 -1

Sample Output 3


222





Example

Input

3 2 2 1
0 3 6
1 1
3 -2


Output

6

Solution (in CPP):

Solution:
#include<iostream>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<map>
#include<vector>

#define fs first
#define sc second
using namespace std;
typedef long long ll;
typedef pair<ll,ll> Line;

int deq[10001];
int N,M,D,X;
ll p[10000],x[10000],y[10000];
ll w[101][10000];
ll dp[2][10000];
Line ch[10000];
const ll INF = 1e14;

ll f(int d,int j,int x){
  return w[d][j] * p[x] + dp[d&1][j] - w[d][j]*p[j];
}

bool check(int d, int f1,int f2, int f3){
  ll a1 = w[d][f1], b1 = dp[d&1][f1] - w[d][f1]*p[f1];
  ll a2 = w[d][f2], b2 = dp[d&1][f2] - w[d][f2]*p[f2];
  ll a3 = w[d][f3], b3 = dp[d&1][f3] - w[d][f3]*p[f3];
  return (a2-a1)*(b3-b2) >= (b2-b1)*(a3-a2);
}

int main(){
  cin >> N >> M >> D >> X;
  for(int i=0;i<N;i++)cin >> p[i];

  for(int i=0;i<M;i++){
    cin >> x[i] >> y[i];
    x[i] -= abs(y[i]);
  }
  sort(x,x+M);

  for(int d=0;d<D;d++){
    int cur = 0;
    for(int i=0;i<N;i++){
      while(cur<M && p[i]>x[cur]+d*X)cur++;
      w[d][i] = M-cur;
    }
  }

  for(int i=0;i<N;i++)dp[0][i] = INF;
  dp[0][0] = 0;
  
  for(int i=0;i<D;i++){
    int now = i&1, nxt = 1-now;
    for(int j=0;j<N;j++)dp[nxt][j] = INF;

    int s = 0, t = 1;
    deq[0] = 0;

    for(int j=0;j<N;j++){
      if(j-1>=0){
	while(s+1<t && check(i, deq[t-2], deq[t-1], j-1))t--;
	deq[t++] = j-1;
      }

      while(s+1<t && f(i,deq[s],j) >= f(i,deq[s+1],j))s++;

      dp[nxt][j] = min(dp[nxt][j], dp[now][j]);
      dp[nxt][j] = min(dp[nxt][j], f(i,deq[s],j));
    }
  }

  cout << dp[D&1][N-1] << endl;
}