Problem: There is a strange peculiarity: if you connect the cities of Rostov, Taganrog and Shakhty, peculiarly, you get a triangle

«Unbelievable But True»

Students from many different parts of Russia and abroad come to Summer Informatics School. You marked the hometowns of the SIS participants on a map.

Now you decided to prepare an interesting infographic based on this map. The first thing you chose to do is to find three cities on this map, such that they form a triangle with area S.

Input

The first line of input contains two integers n and S (3 ≤ n ≤ 2000, 1 ≤ S ≤ 2 ⋅ 10^{18}) — the number of cities on the map and the area of the triangle to be found.

The next n lines contain descriptions of the cities, one per line. Each city is described by its integer coordinates x_i, y_i (-10^9 ≤ x_i, y_i ≤ 10^9). 

It is guaranteed that all cities are located at distinct points. It is also guaranteed that no three cities lie on the same line.

Output

If the solution doesn't exist — print «No».

Otherwise, print «Yes», followed by three pairs of coordinates (x, y) — the locations of the three cities, which form the triangle of area S.

Examples

Input

3 7
0 0
3 0
0 4


Output

No


Input

4 3
0 0
2 0
1 2
1 3


Output

Yes
0 0
1 3
2 0

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int N = 2005;
template <typename T>
void read(T &x) {
  bool neg = false;
  unsigned char c = getchar();
  for (; (c ^ 48) > 9; c = getchar())
    if (c == '-') neg = true;
  for (x = 0; (c ^ 48) < 10; c = getchar()) x = (x << 3) + (x << 1) + (c ^ 48);
  if (neg) x = -x;
}
struct slope {
  int x, y, u, v;
  void pos() {
    if (x < 0) x = -x, y = -y;
  }
  slope(int a = 0, int b = 0) { x = a, y = b; }
  bool operator<(slope b) const {
    if (b.x == 0) return false;
    if (x == 0) return true;
    return y * (long long)b.x < b.y * (long long)x;
  }
} s[N * N / 2];
struct point {
  int x, y;
  slope operator-(point b) { return slope(x - b.x, y - b.y); }
} p[N];
int n, m, id[N], rnk[N];
long long a;
bool cmp(int a, int b) {
  return p[a].x != p[b].x ? p[a].x < p[b].x : p[a].y > p[b].y;
}
inline long long cross(point a, point b) {
  return a.x * (long long)b.y - a.y * (long long)b.x;
}
inline long long area(point a, point b, point c) {
  long long ans = cross(a, b) + cross(b, c) + cross(c, a);
  return ans > 0 ? ans : -ans;
}
bool find(int l, int r, point u, point v) {
  int mid;
  long long tmp;
  static int cnt = 0;
  ++cnt;
  while (r - l > 1) {
    mid = (l + r) >> 1;
    tmp = area(p[id[mid]], u, v);
    if (cnt & 1 ? tmp < a : tmp > a)
      r = mid;
    else
      l = mid;
  }
  if (area(p[l = id[l]], u, v) == a) {
    puts("Yes");
    printf("%d %d\n", p[l].x, p[l].y);
    printf("%d %d\n", u.x, u.y);
    printf("%d %d\n", v.x, v.y);
    return true;
  }
  return false;
}
int main() {
  read(n);
  read(a);
  a *= 2;
  for (int i = 0, i_end = n; i < i_end; ++i)
    read(p[i].x), read(p[i].y), id[i] = i;
  for (int i = 0, i_end = n; i < i_end; ++i)
    for (int j = i + 1, j_end = n; j < j_end; ++j)
      (s[m] = p[j] - p[i]).pos(), s[m].v = j, s[m].u = i, ++m;
  sort(s, s + m);
  sort(id, id + n, cmp);
  for (int i = 0, i_end = n; i < i_end; ++i) rnk[id[i]] = i;
  for (int i = 0, i_end = m; i < i_end; ++i) {
    int u = s[i].u, v = s[i].v;
    swap(id[rnk[u]], id[rnk[v]]);
    swap(rnk[u], rnk[v]);
    if (find(0, min(rnk[u], rnk[v]), p[u], p[v])) return 0;
    if (find(max(rnk[u], rnk[v]) + 1, n, p[u], p[v])) return 0;
  }
  puts("No");
  return 0;
}