Yaroslav is playing a game called "Time". The game has a timer showing the lifespan he's got left. As soon as the timer shows 0, Yaroslav's character dies and the game ends. Also, the game has n clock stations, station number i is at point (x_{i}, y_{i}) of the plane. As the player visits station number i, he increases the current time on his timer by a_{i}. The stations are for one-time use only, so if the player visits some station another time, the time on his timer won't grow.

A player spends d·dist time units to move between stations, where dist is the distance the player has covered and d is some constant. The distance between stations i and j is determined as |x_{i} - x_{j}| + |y_{i} - y_{j}|.

Initially, the player is at station number 1, and the player has strictly more than zero and strictly less than one units of time. At station number 1 one unit of money can increase the time on the timer by one time unit (you can buy only integer number of time units).

Now Yaroslav is wondering, how much money he needs to get to station n. Help Yaroslav. Consider the time to buy and to increase the timer value negligibly small.


-----Input-----

The first line contains integers n and d (3 ≤ n ≤ 100, 10^3 ≤ d ≤ 10^5) — the number of stations and the constant from the statement.

The second line contains n - 2 integers: a_2, a_3, ..., a_{n} - 1 (1 ≤ a_{i} ≤ 10^3). The next n lines contain the coordinates of the stations. The i-th of them contains two integers x_{i}, y_{i} (-100 ≤ x_{i}, y_{i} ≤ 100).

It is guaranteed that no two stations are located at the same point.


-----Output-----

In a single line print an integer — the answer to the problem.


-----Examples-----
Input
3 1000
1000
0 0
0 1
0 3

Output
2000

Input
3 1000
1000
1 0
1 1
1 2

Output
1000

```python

USER_FILENAME = "<user_code>"
import sys, json, builtins
import math, heapq, bisect, itertools, functools, collections, statistics, fractions, decimal, operator, array, random, re, string, os, pathlib
try:
    import resource as _res
except Exception:
    _res = None
from collections import Counter, defaultdict, deque, OrderedDict
from functools import lru_cache, reduce
from itertools import accumulate, permutations, combinations, product
from math import gcd, ceil, floor, sqrt
from decimal import Decimal
try:
    from typing import *
except Exception:
    pass
try:
    sys.setrecursionlimit(1_000_000)
except Exception:
    pass
try:
    import site as _site
    try:
        _sys_sites = _site.getsitepackages() if hasattr(_site, "getsitepackages") else []
        for _p in _sys_sites:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
    try:
        _usp = _site.getusersitepackages()
        if isinstance(_usp, str):
            _usp = [_usp]
        for _p in _usp:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
except Exception:
    pass

ns = {"__name__": "__main__"}
for _k, _v in list(globals().items()):
    if not _k.startswith("_"):
        ns[_k] = _v
_CODE = 'from sys import stdin, stdout\nfrom math import inf\n\n\ndef main():\n    n, d = readline()\n    a = [0] + list(readline()) + [0]\n    x = [0] * n\n    y = [0] * n\n    # parent = [-1] * n  #  In case you want to know the path traveled\n    for i in range(n):\n        x[i], y[i] = readline()\n    return dijkstra(n, d, a, x, y)  # , parent)\n\n\ndef readline():\n    return list(map(int, stdin.readline().strip().split()))\n\n\ndef dijkstra(n, d, a, x, y):  # , parent):\n    lower_cost = [inf] * n\n    lower_cost[0] = 0\n    visited = [False] * n\n    for i in range(n - 1):\n        position = minimum(n, visited, lower_cost)\n        if position == n - 1:\n            break\n        visited[position] = True\n        for k in range(n):\n            if not visited[k]:\n                diff = lower_cost[position] + d * (abs(x[k] - x[position]) + abs(y[k] - y[position])) - a[position]\n                if lower_cost[k] > diff:\n                    lower_cost[k] = diff\n                    # parent[k] = position\n    return lower_cost[-1]\n\n\ndef minimum(n, visited, lower_cost):\n    lower_value = inf\n    position = 0\n    for j in range(n):\n        if not visited[j] and lower_value > lower_cost[j]:\n            lower_value = lower_cost[j]\n            position = j\n    return position\n\n\ndef __starting_point():\n    stdout.write("".join(str(main()) + "\\n"))\n\n__starting_point()'
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

```

Measured memory_bytes: 14871