#include <bits/stdc++.h>
using namespace std;
template <class C>
void mini(C &a4, C b4) {
  a4 = min(a4, b4);
}
template <class C>
void maxi(C &a4, C b4) {
  a4 = max(a4, b4);
}
template <class TH>
void _dbg(const char *sdbg, TH h) {
  cerr << sdbg << "=" << h << "\n";
}
template <class TH, class... TA>
void _dbg(const char *sdbg, TH h, TA... a) {
  while (*sdbg != ',') cerr << *sdbg++;
  cerr << "=" << h << ",";
  _dbg(sdbg + 1, a...);
}
template <class T>
ostream &operator<<(ostream &os, vector<T> V) {
  os << "[";
  for (auto vv : V) os << vv << ",";
  return os << "]";
}
template <class L, class R>
ostream &operator<<(ostream &os, pair<L, R> P) {
  return os << "(" << P.first << "," << P.second << ")";
}
void fix(pair<long long, long long> &v1) {
  if (v1.first < 0 || (v1.first == 0 && v1.second < 0)) {
    v1.first = -v1.first;
    v1.second = -v1.second;
  }
}
pair<long long, long long> &operator-=(pair<long long, long long> &lhs,
                                       const pair<long long, long long> &rhs) {
  lhs.first -= rhs.first;
  lhs.second -= rhs.second;
  return lhs;
}
pair<long long, long long> operator-(pair<long long, long long> lhs,
                                     const pair<long long, long long> &rhs) {
  lhs -= rhs;
  return lhs;
}
vector<pair<long long, long long> > inp;
long long crossProd(pair<long long, long long> p1,
                    pair<long long, long long> p2) {
  return p1.first * p2.second - p2.first * p1.second;
}
bool cmp(pair<long long, long long> v1, pair<long long, long long> v2) {
  pair<long long, long long> a = inp[v1.first] - inp[v1.second];
  pair<long long, long long> b = inp[v2.first] - inp[v2.second];
  fix(a);
  fix(b);
  return crossProd(a, b) > 0;
}
void ans(vector<pair<long long, long long> > v) {
  cout << "Yes\n";
  for (pair<long long, long long> x : v) {
    cout << x.first << " " << x.second << "\n";
  }
  exit(0);
}
long long ar(long long x, long long y, long long z) {
  return crossProd(inp[x] - inp[y], inp[z] - inp[y]);
}
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout << fixed << setprecision(11);
  if (0) cout << fixed << setprecision(6);
  long long n, s;
  cin >> n >> s;
  s *= 2;
  inp.resize(n);
  for (long long i = (0); i <= ((long long)(n)-1); i++) {
    long long x, y;
    cin >> x >> y;
    inp[i] = {x, y};
  }
  sort((inp).begin(), (inp).end());
  for (long long i = (0); i <= ((long long)(n)-1); i++) {
  }
  vector<pair<long long, long long> > swaps;
  for (long long i = (0); i <= ((long long)(n)-1); i++) {
    for (long long j = (0); j <= ((long long)(i)-1); j++) {
      swaps.push_back({i, j});
    }
  }
  vector<long long> where(n);
  iota((where).begin(), (where).end(), 0);
  sort((swaps).begin(), (swaps).end(), cmp);
  for (pair<long long, long long> p : swaps) {
    long long i = p.first;
    long long j = p.second;
    (where[i], where[j]);
    swap(where[i], where[j]);
    assert(abs(where[i] - where[j]) == 1);
    swap(inp[where[i]], inp[where[j]]);
    long long x = where[i];
    long long y = where[j];
    if (ar(x, y, 0) > ar(x, y, n - 1)) {
      swap(x, y);
    }
    long long area;
    long long l = 0, r = n - 1;
    while (l < r) {
      long long m = (l + r) / 2;
      area = ar(x, y, m);
      if (area < s) {
        l = m + 1;
      } else {
        r = m;
      }
    }
    area = ar(x, y, l);
    if (area == s) {
      ans({inp[x], inp[y], inp[l]});
    }
    l = 0, r = n - 1;
    while (l < r) {
      long long m = (l + r) / 2;
      area = ar(x, y, m);
      if (area < -s) {
        l = m + 1;
      } else {
        r = m;
      }
    }
    area = ar(x, y, l);
    if (area == -s) {
      ans({inp[x], inp[y], inp[l]});
    }
  }
  cout << "No\n";
}
