public static void Solve(Scanner cin)
	{
		var (n, d) = cin.ReadValue<int, long>();
		var (x, y) = cin.ReadValueArray<long, long>(n);
		var first = new (long x, long y)[(n + 1) / 2];
		var second = new (long x, long y)[n - (n + 1) / 2];
		for (int i = 0; i < n; i++)
		{
			if (i < (n + 1) / 2) first[i] = (x[i], y[i]);
			else second[i - (n + 1) / 2] = (x[i], y[i]);
		}

		var xall = x.Sum();
		var yall = y.Sum();

		var pow = new List<long>();
		long t = 1;
		for (int i = 0; i < 17; i++)
		{
			pow.Add(t);
			t *= 3;
		}

		var firstData = new (long xsum, long ysum)[pow[first.Length]];
		var secondData = new (long xsum, long ysum)[pow[second.Length]];
		for (int i = 0; i < pow[first.Length]; i++)
		{
			long xsumaf = 0;
			long ysumaf = 0;
			long xsumbf = 0;
			long ysumbf = 0;
			long xsumas = 0;
			long ysumas = 0;
			long xsumbs = 0;
			long ysumbs = 0;
			var tmp = i;
			for (int j = 0; j < first.Length; j++)
			{
				var state = tmp % 3;
				if (state == 1)
				{
					xsumaf += first[j].x;
					ysumaf += first[j].y;
					if (j < second.Length)
					{
						xsumas += second[j].x;
						ysumas += second[j].y;
					}
				}
				if (state == 2)
				{
					xsumbf += first[j].x;
					ysumbf += first[j].y;
					if (j < second.Length)
					{
						xsumbs += second[j].x;
						ysumbs += second[j].y;
					}
				}
				tmp /= 3;
			}
			firstData[i] = (xsumaf - xsumbf, ysumbf - ysumaf);
			if (i < pow[second.Length]) secondData[i] = (xsumas - xsumbs, ysumbs - ysumas);
		}
		Array.Sort(firstData);
		Array.Sort(secondData);
		var secondXsum = secondData.Select(p => p.xsum).ToArray();
		var secondYsum = secondData.Select(p => p.ysum).ToArray();

		var deq = new Deque<int>(secondXsum.Length);
		var l = secondXsum.LowerBound(-d - firstData[0].xsum) - 1;
		var r = secondXsum.UpperBound(d - firstData[0].xsum) - 1;
		long ans = long.MinValue;
		for (int i = r; i > l; i--)
		{
			while (deq.Count > 0 && secondYsum[deq.Last] < secondYsum[i]) deq.PopBack();
			deq.PushBack(i);
		}
		var ysum = firstData[0].ysum + secondYsum[deq.First];
		if (l < r && ans < ysum) ans = ysum;
		for (int i = 1; i < firstData.Length; i++)
		{
			var min = -d - firstData[i].xsum;
			var max = d - firstData[i].xsum;
			while (l >= 0 && secondXsum[l] >= min)
			{
				while (deq.Count > 0 && secondYsum[deq.Last] < secondYsum[l]) deq.PopBack();
				deq.PushBack(l);
				l--;
			}
			while (r >= 0 && max < secondXsum[r])
			{
				r--;
			}
			while (deq.Count > 0 && deq.First > r)
			{
				deq.PopFront();
			}

			if (l >= r) continue;
			ysum = firstData[i].ysum + secondYsum[deq.First];
			if (ans < ysum) ans = ysum;
		}

		Console.WriteLine(ans);
	}

	static class Program
	{
		public static void Solve(Scanner cin)
		{
			var (n, d) = cin.ReadValue<int, long>();
			var (x, y) = cin.ReadValueArray<long, long>(n);
 
			var fc = n / 2;
			var sc = n - fc;
 
			var first = new (long x, long y)[1];
			var second = new (long x, long y)[1];
 
			for (int i = 0; i < fc; i++)
			{
				var tmp1 = new (long x, long y)[first.Length];
				var tmp2 = new (long x, long y)[first.Length];
				for (int j = 0; j < first.Length; j++)
				{
					tmp1[j] = (first[j].x + x[i], first[j].y + y[i]);
					tmp2[j] = (first[j].x - x[i], first[j].y - y[i]);
				}
				first = Merge(first, tmp1);
				first = Merge(first, tmp2);
				GC.Collect();
			}
 
			for (int i = fc; i < n; i++)
			{
				var tmp1 = new (long x, long y)[second.Length];
				var tmp2 = new (long x, long y)[second.Length];
				for (int j = 0; j < second.Length; j++)
				{
					tmp1[j] = (second[j].x + x[i], second[j].y + y[i]);
					tmp2[j] = (second[j].x - x[i], second[j].y - y[i]);
				}
				second = Merge(second, tmp1);
				second = Merge(second, tmp2);
				GC.Collect();
			}
 
			long ans = long.MinValue;
			var swag = new SWAG<long>((x, y) => Math.Max(x, y));
			var l = 0;
			var r = 0;
			{
				var secondY = second.Select(p => p.y).ToArray();
 
				l = secondY.LowerBound(-d - first[0].x) - 1;
				r = secondY.UpperBound(d - first[0].x) - 1;
			}
			for (int i = r; i > l; i--)
			{
				swag.Push(second[i].y);
			}
 
			if (swag.Count > 0) Chmax(ref ans, swag.Prod());
			for (int i = 1; i < first.Length; i++)
			{
				while (l >= 0 && first[i].x + second[l].x >= -d)
				{
					swag.Push(second[l].y);
					l--;
				}
				while (r >= 0 && first[i].x + second[r].x > d)
				{
					if (l != r) swag.Pop();
					r--;
				}
 
				if (l >= r) continue;
				Chmax(ref ans, first[i].y + swag.Prod());
			}
 
			Console.WriteLine(ans);
		}
 
		public static T[] Merge<T>(T[] first, T[] second) where T : IComparable<T>
		{
			var ret = new T[first.Length + second.Length];
			int p = 0;
			int q = 0;
			while (p < first.Length || q < second.Length)
			{
				if (p == first.Length)
				{
					ret[p + q] = second[q];
					q++;
					continue;
				}
				if (q == second.Length)
				{
					ret[p + q] = first[p];
					p++;
					continue;
				}
				if (first[p].CompareTo(second[q]) < 0)
				{
					ret[p + q] = first[p];
					p++;
				}
				else
				{
					ret[p + q] = second[q];
					q++;
				}
			}
			return ret;
		}
	}
 
	public class SWAG<T>
	{
		Stack<(T value, T prod)> front, back;
		Func<T, T, T> monoid;
 
		public int Count { get; private set; }
 
		public SWAG(Func<T, T, T> monoid)
		{
			this.monoid = monoid;
			front = new Stack<(T value, T prod)>();
			back = new Stack<(T value, T prod)>();
		}
 
		public SWAG(IEnumerable<T> list, Func<T, T, T> monoid) : this(monoid)
		{
			foreach (var e in list)
			{
				Push(e);
			}
		}
 
		public T Prod()
		{
			if (front.Count == 0 && back.Count == 0) throw new InvalidOperationException();
			if (front.Count == 0) return back.Peek().prod;
			if (back.Count == 0) return front.Peek().prod;
			return monoid(front.Peek().prod, back.Peek().prod);
		}
 
		public void Push(T x)
		{
			Count++;
			if (back.Count == 0) back.Push((x, x));
			else back.Push((x, monoid(back.Peek().prod, x)));
		}
 
		public T Pop()
		{
			if (Count == 0) throw new InvalidOperationException();
			Count--;
			if (front.Count == 0)
			{
				while (back.Count > 0)
				{
					var e = back.Pop();
					if (front.Count == 0) front.Push((e.value, e.value));
					else front.Push((e.value, monoid(front.Peek().prod, e.value)));
				}
			}
			return front.Pop().value;
		}
	}