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 inf = (int)1.01e9;
const long long infll = (long long)1.01e18;
const long double eps = 1e-9;
const long double pi = acos((long double)-1);
mt19937 mrand(chrono::steady_clock::now().time_since_epoch().count());
int rnd(int x) { return mrand() % x; }
void precalc() {}
struct point {
  int x, y;
  point() : x(0), y(0) {}
  point(int _x, int _y) : x(_x), y(_y) {}
  bool read() { return scanf("%d%d", &x, &y) == 2; }
  void print() { printf("%d %d\n", x, y); }
  point operator+(const point &p) const { return point(x + p.x, y + p.y); }
  point operator-(const point &p) const { return point(x - p.x, y - p.y); }
  long long operator^(const point &p) const {
    return (long long)x * p.y - (long long)y * p.x;
  }
  int type() const { return x < 0 || (x == 0 && y > 0); }
};
bool operator<(const point &a, const point &b) {
  if (a.type() != b.type()) {
    return a.type() < b.type();
  }
  return (a ^ b) > 0;
}
bool cmp(const point &a, const point &b) {
  if (a.x != b.x) {
    return a.x < b.x;
  }
  return a.y > b.y;
}
const int maxn = 2005;
int n;
long long s;
point ps[maxn];
bool read() {
  if (scanf("%d%lld", &n, &s) < 2) {
    return false;
  }
  s *= 2;
  for (int i = 0; i < n; i++) {
    ps[i].read();
  }
  return true;
}
point ps0[maxn];
vector<pair<pair<point, long long>, pair<int, int>>> ls;
int get(const point &dir, long long x) {
  int l = 0, r = n;
  while (l < r - 1) {
    int m = (l + r) / 2;
    if ((dir ^ ps[m]) > x) {
      r = m;
    } else {
      l = m;
    }
  }
  if ((dir ^ ps[l]) != x) {
    return -1;
  }
  return l;
}
void solve() {
  for (int i = 0; i < n; i++) {
    ps0[i] = ps[i];
  }
  ls.clear();
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      if (j == i) {
        continue;
      }
      ls.push_back(
          make_pair(make_pair(ps[j] - ps[i], s + ((ps[j] - ps[i]) ^ ps[i])),
                    make_pair(i, j)));
    }
  }
  sort(ls.begin(), ls.end());
  sort(ps, ps + n, cmp);
  for (int i = 0; i < ((int)(ls).size()); i++) {
    point dir = ls[i].first.first;
    long long need = ls[i].first.second;
    int v = ls[i].second.first, u = ls[i].second.second;
    int p = get(dir, need);
    if (p != -1) {
      printf("Yes\n");
      ps0[v].print();
      ps0[u].print();
      ps[p].print();
      return;
    }
    p = get(dir, need - s);
    swap(ps[p - 1], ps[p]);
  }
  printf("No\n");
}
int main() {
  precalc();
  while (read()) {
    solve();
  }
  return 0;
}