#include <bits/stdc++.h>
using namespace std;
const int N = 2005;
int x[N], y[N], n;
long long S;
int main() {
  scanf("%d%lld", &n, &S);
  S <<= 1;
  for (int i = 1; i <= n; i++) scanf("%d%d", &x[i], &y[i]);
  for (int i = 1; i <= n; i++)
    for (int j = i + 1; j <= n; j++) {
      long long K1 = y[j] - y[i], K2 = x[j] - x[i];
      long long K = -K1 * x[i] + K2 * y[i];
      for (int k = j + 1; k <= n; k++) {
        long long t = K1 * x[k] - K2 * y[k] + K;
        if (t == S || t == -S) {
          puts("Yes");
          printf("%d %d\n%d %d\n%d %d\n", x[i], y[i], x[j], y[j], x[k], y[k]);
          return 0;
        }
      }
    }
  puts("No");
}
