#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,sse4,ssse3,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
using namespace std;
const int N = 2100;
int n;
long long s, x[N], y[N], c[N][N];
int main() {
  scanf("%d %lld", &n, &s);
  s *= 2;
  for (int i = 0; i < n; i++) {
    scanf("%lld %lld", &x[i], &y[i]);
  }
  for (int i = 0; i < n; i++) {
    for (int j = i + 1; j < n; j++) {
      long long t = x[i] * y[j] - x[j] * y[i];
      c[i][j] = t;
    }
  }
  for (int i = 0; i < n; i++) {
    for (int j = i + 1; j < n; j++) {
      for (int k = j + 1; k < n; k++) {
        long long t = c[i][j] + c[j][k] - c[i][k];
        if (t == s || t == -s) {
          printf("Yes\n%lld %lld\n%lld %lld\n%lld %lld\n", x[i], y[i], x[j],
                 y[j], x[k], y[k]);
          exit(0);
        }
      }
    }
  }
  puts("No");
  return 0;
}
