#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<cstring>
#include<functional>
using namespace std;
#define ll long long
const ll linf = 1e15;
struct node{
    int h, w;
    ll cost;
    bool operator<(const node &n1) const {
        return n1.cost < cost;
    }
};

struct edge{
    int h, w, k;
    ll cost;
    bool operator<(const edge &e1) const {
        return e1.cost < cost;
    }
};

int H, W, N;
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
ll A, B, C;
ll D[501][501][5], near[501][501];
int ph[100010], pw[100010];

void dijk(){
    for(int i = 0; i <= H; i++){
        for(int j = 0; j <= W; j++){
            near[i][j] = linf;
        }
    }
    priority_queue<node> pq;
    for(int i = 1; i <= N; i++){
        near[ph[i]][pw[i]] = 0;
        pq.push(node{ph[i], pw[i], 0});
    }
    
    while(!pq.empty()){
        int h = pq.top().h;
        int w = pq.top().w;
        ll cost = pq.top().cost;
        pq.pop();
        if(near[h][w] < cost) continue;
        
        cost++;
        for(int i = 0; i < 4; i++){
            int nh = h + dx[i];
            int nw = w + dy[i];
            if(nh < 0 || H < nh) continue;
            if(nw < 0 || W < nw) continue;
            if(near[nh][nw] > cost){
                near[nh][nw] = cost;
                pq.push(node{nh, nw, cost});
            }
        }
    }
}

ll solve(){
    dijk();
    for(int i = 0; i <= H; i++){
        for(int j = 0; j <= W; j++){
            for(int k = 0; k <= 4; k++){
                D[i][j][k] = linf;
            }
        }
    }
    priority_queue<edge> pq;
    pq.push(edge{ph[1], pw[1], 4, 0});
    D[ph[1]][pw[1]][4] = 0;

    while(!pq.empty()){
        int h = pq.top().h;
        int w = pq.top().w;
        int k = pq.top().k;
        ll cost = pq.top().cost;
        pq.pop();

        if(D[h][w][k] < cost) continue;

        if(k == 4){
            for(int i = 0; i < 4; i++){
                int nh = h + dx[i];
                int nw = w + dy[i];
                if(nh < 0 || H < nh) continue;
                if(nw < 0 || W < nw) continue;
                if(D[nh][nw][k] > cost + C){
                    D[nh][nw][k] = cost + C;
                    pq.push(edge{nh, nw, k, cost + C});
                }
            }
            for(int i = 0; i < 4; i++){
                ll new_c = cost + B;
                if(D[h][w][i] > new_c){
                    D[h][w][i] = new_c;
                    pq.push(edge{h, w, i, new_c});
                }
            }
        }else{
            ll new_c = cost + near[h][w] * C;
            if(D[h][w][4] > new_c){
                D[h][w][4] = new_c;
                pq.push(edge{h, w, 4, new_c});
            }
            
            new_c = cost + A;
            int nh = h + dx[k];
            int nw = w + dy[k];
            if(nh < 0 || H < nh) continue;
            if(nw < 0 || W < nw) continue;
            if(D[nh][nw][k] > new_c){
                D[nh][nw][k] = new_c;
                pq.push(edge{nh, nw, k, new_c});
            }
        }
    }
    ll ans = linf;
    for(int i = 0; i <= 4; i++){
        ans = min(ans, D[ph[N]][pw[N]][i]);
    }
    return ans;
}

void init(){
    cin >> H >> W >> A >> B >> C >> N;
    for(int i = 1; i <= N; i++){
        cin >> ph[i] >> pw[i];
    }
}

int main(){
    init();
    cout << solve() << endl;
    return 0;
}

### Prompt

Your task is to create a Cpp solution to the following problem:

You are a manager of a prestigious soccer team in the JOI league.

The team has $N$ players numbered from 1 to $N$. The players are practicing hard in order to win the tournament game. The field is a rectangle whose height is $H$ meters and width is $W$ meters. The vertical line of the field is in the north-south direction, and the horizontal line of the field is in the east-west direction. A point in the field is denoted by ($i, j$) if it is $i$-meters to the south and $j$ meters to the east from the northwest corner of the field.

After the practice finishes, players must clear the ball. In the beginning of the clearance, the player $i$ ($1 \leq i \leq N$) stands at ($S_i, T_i$). There is only one ball in the field, and the player 1 has it. You stand at ($S_N, T_N$) with the player $N$. The clearance is finished if the ball is passed to ($S_N, T_N$), and you catch it. You cannot move during the clearance process.

You can ask players to act. But, if a player acts, his fatigue degree will be increased according to the action. Here is a list of possible actions of the players. If a player has the ball, he can act (i),(ii), or (iii). Otherwise, he can act (ii) or (iv).

* (i) Choose one of the 4 directions (east/west/south/north), and choose a positive integer $p$. Kick the ball to that direction. Then, the ball moves exactly p meters. The kicker does not move by this action, and he loses the ball. His fatigue degree is increased by $A \times p + B$.
* (ii) Choose one of the 4 directions (east/west/south/north), and move 1 meter to that direction. If he has the ball, he moves with it. His fatigue degree is increased by $C$ regardless of whether he has the ball or not.
* (iii) Place the ball where he stands. He loses the ball. His fatigue degree does not change.
* (iv) Take the ball. His fatigue degree does not change. A player can take this action only if he stands at the same place as the ball, and nobody has the ball.



Note that it is possible for a player or a ball to leave the field. More than one players can stand at the same place.

Since the players just finished the practice, their fatigue degrees must not be increased too much. You want to calculate the minimum possible value of the sum of fatigue degrees of the players for the clearance process.





Example

Input

6 5
1 3 6
3
1 1
0 4
6 5


Output

26

### Response

```cpp
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<cstring>
#include<functional>
using namespace std;
#define ll long long
const ll linf = 1e15;
struct node{
    int h, w;
    ll cost;
    bool operator<(const node &n1) const {
        return n1.cost < cost;
    }
};

struct edge{
    int h, w, k;
    ll cost;
    bool operator<(const edge &e1) const {
        return e1.cost < cost;
    }
};

int H, W, N;
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
ll A, B, C;
ll D[501][501][5], near[501][501];
int ph[100010], pw[100010];

void dijk(){
    for(int i = 0; i <= H; i++){
        for(int j = 0; j <= W; j++){
            near[i][j] = linf;
        }
    }
    priority_queue<node> pq;
    for(int i = 1; i <= N; i++){
        near[ph[i]][pw[i]] = 0;
        pq.push(node{ph[i], pw[i], 0});
    }
    
    while(!pq.empty()){
        int h = pq.top().h;
        int w = pq.top().w;
        ll cost = pq.top().cost;
        pq.pop();
        if(near[h][w] < cost) continue;
        
        cost++;
        for(int i = 0; i < 4; i++){
            int nh = h + dx[i];
            int nw = w + dy[i];
            if(nh < 0 || H < nh) continue;
            if(nw < 0 || W < nw) continue;
            if(near[nh][nw] > cost){
                near[nh][nw] = cost;
                pq.push(node{nh, nw, cost});
            }
        }
    }
}

ll solve(){
    dijk();
    for(int i = 0; i <= H; i++){
        for(int j = 0; j <= W; j++){
            for(int k = 0; k <= 4; k++){
                D[i][j][k] = linf;
            }
        }
    }
    priority_queue<edge> pq;
    pq.push(edge{ph[1], pw[1], 4, 0});
    D[ph[1]][pw[1]][4] = 0;

    while(!pq.empty()){
        int h = pq.top().h;
        int w = pq.top().w;
        int k = pq.top().k;
        ll cost = pq.top().cost;
        pq.pop();

        if(D[h][w][k] < cost) continue;

        if(k == 4){
            for(int i = 0; i < 4; i++){
                int nh = h + dx[i];
                int nw = w + dy[i];
                if(nh < 0 || H < nh) continue;
                if(nw < 0 || W < nw) continue;
                if(D[nh][nw][k] > cost + C){
                    D[nh][nw][k] = cost + C;
                    pq.push(edge{nh, nw, k, cost + C});
                }
            }
            for(int i = 0; i < 4; i++){
                ll new_c = cost + B;
                if(D[h][w][i] > new_c){
                    D[h][w][i] = new_c;
                    pq.push(edge{h, w, i, new_c});
                }
            }
        }else{
            ll new_c = cost + near[h][w] * C;
            if(D[h][w][4] > new_c){
                D[h][w][4] = new_c;
                pq.push(edge{h, w, 4, new_c});
            }
            
            new_c = cost + A;
            int nh = h + dx[k];
            int nw = w + dy[k];
            if(nh < 0 || H < nh) continue;
            if(nw < 0 || W < nw) continue;
            if(D[nh][nw][k] > new_c){
                D[nh][nw][k] = new_c;
                pq.push(edge{nh, nw, k, new_c});
            }
        }
    }
    ll ans = linf;
    for(int i = 0; i <= 4; i++){
        ans = min(ans, D[ph[N]][pw[N]][i]);
    }
    return ans;
}

void init(){
    cin >> H >> W >> A >> B >> C >> N;
    for(int i = 1; i <= N; i++){
        cin >> ph[i] >> pw[i];
    }
}

int main(){
    init();
    cout << solve() << endl;
    return 0;
}

```