#include<iostream>
#include<algorithm>
using namespace std;
int f[100001];
long long n, h, a, d,ans;
long long s[100001][2];
long long qw[10002],qe[10002];
bool df(int a, int b)
{
	long long midy = (h*2) -(b - a);
	if (midy < (f[a]*2) || midy < (f[b]*2))
		return 0;
	long long midx = (a + b);
	long long r = (b -a);
	r *= r;
	for (int i = a; i <= b; i++)
	{
		if (f[i]>=0)
		{
			if (((f[i]*2)>=midy)&&((midx - (i*2)) * (midx - (i*2)) + (midy - (f[i]*2)) * (midy -(f[i]*2)))>r)
				return 0;
		}
	}
	return 1;
}
int vv = 0;
long long min1 = -1;
void dfs()
{
	for (int i = 2; i <= ans; i++)
	{
		for (int u = i-1; u>=1; u--)
		{
			if (qw[u]&&(df(s[u][0], s[i][0])))
			{
				if (!qw[i])
				{
					qw[i] = qw[u] + d * ((s[i][0] - s[u][0]) * (s[i][0] - s[u][0])) + s[i][1];
					
				}
				else
				{
					qw[i] = min(qw[i], qw[u] + d * ((s[i][0] - s[u][0]) * (s[i][0] - s[u][0])) + s[i][1]);
					
				}
				if (i == ans)
				{
					if (min1 > qw[i]||min1==-1)
						min1 = qw[i];
					vv = 1;
				}
			}
		}
	}
}
int main()
{
	cin >> n >> h >> a >> d;
	int x,fr;
	ans = n;
	for (int i = 1; i <= 100000; i++)
		f[i] = -1;
	for (int i = 1; i <= n; i++)
	{
		scanf("%d", &x);
		scanf("%d", &f[x]);
		s[i][0] = x;
		s[i][1] = a * (h - f[s[i][0]]);
	}
	qw[1] = s[1][1];
	
	dfs();
	if (!vv)
		cout << "impossible";
	if(vv)
		cout << min1 << endl;
}