#include <bits/stdc++.h>
using namespace std;
const int inf = 1e9;
const long long Inf = 1e18;
const int N = 2e3 + 10;
int gi() {
  int x = 0, o = 1;
  char ch = getchar();
  while ((ch < '0' || ch > '9') && ch != '-') ch = getchar();
  if (ch == '-') o = -1, ch = getchar();
  while (ch >= '0' && ch <= '9') x = x * 10 + ch - '0', ch = getchar();
  return x * o;
}
template <typename T>
void chkmax(T &a, T b) {
  a < b ? a = b : 0;
};
template <typename T>
void chkmin(T &a, T b) {
  a > b ? a = b : 0;
};
struct point {
  int x, y;
} p[N];
struct line {
  int x, y;
  double k;
} l[N * N];
bool cmp(point a, point b) { return a.x < b.x || (a.x == b.x && a.y < b.y); }
bool cmp2(line a, line b) { return a.k < b.k; }
long long cross(point a, point b, point c) {
  int x1 = c.x - a.x, x2 = b.x - a.x, y1 = c.y - a.y, y2 = b.y - a.y;
  return 1ll * x1 * y2 - 1ll * x2 * y1;
}
long long calc(int i, int j, int k) { return abs(cross(p[i], p[j], p[k])); }
void print(int i, int j, int k) {
  puts("Yes");
  printf("%d %d\n", p[i].x, p[i].y);
  printf("%d %d\n", p[j].x, p[j].y);
  printf("%d %d\n", p[k].x, p[k].y);
}
int n, tot = 0, a[N], pos[N];
long long s;
int main() {
  cin >> n >> s;
  s <<= 1;
  for (int i = 1; i <= n; i++) p[i].x = gi(), p[i].y = gi();
  sort(p + 1, p + n + 1, cmp);
  for (int i = 1; i <= n; i++)
    for (int j = i + 1; j <= n; j++)
      l[++tot] = {i, j, 1.0 * (p[j].y - p[i].y) / (p[j].x - p[i].x)};
  sort(l + 1, l + tot + 1, cmp2);
  for (int i = 1; i <= n; i++) a[i] = pos[i] = i;
  for (int i = 1; i <= tot; i++) {
    int x = l[i].x, y = l[i].y;
    if (pos[x] > pos[y]) swap(x, y);
    int l = 1, r = pos[x] - 1;
    while (l <= r) {
      int mid = (l + r) >> 1;
      long long tmp = calc(x, y, a[mid]);
      if (tmp == s) return print(x, y, a[mid]), 0;
      if (tmp < s)
        r = mid - 1;
      else
        l = mid + 1;
    }
    l = pos[y] + 1, r = n;
    while (l <= r) {
      int mid = (l + r) >> 1;
      long long tmp = calc(x, y, a[mid]);
      if (tmp == s) return print(x, y, a[mid]), 0;
      if (tmp < s)
        l = mid + 1;
      else
        r = mid - 1;
    }
    swap(a[pos[x]], a[pos[y]]);
    swap(pos[x], pos[y]);
  }
  puts("No");
  return 0;
}
