#include <bits/stdc++.h>
using namespace std;
int n, p[2005][2];
long long G[2005][2005];
int main() {
  long long S;
  cin >> n >> S;
  S <<= 1;
  for (int i = 0; i < n; ++i) {
    cin >> p[i][0] >> p[i][1];
  }
  for (int i = 0; i < n - 1; ++i) {
    for (register int j = i + 1; j < n; ++j) {
      G[i][j] = (long long)p[i][0] * p[j][1] - (long long)p[i][1] * p[j][0];
    }
  }
  for (int i = 0; i < n - 2; ++i) {
    for (int j = i + 1; j < n - 1; ++j) {
      long long aim1 = S - G[i][j], aim2 = -S - G[i][j];
      for (register int k = j + 1; k < n; ++k) {
        long long x = -G[i][k] + G[j][k];
        if (x == aim1 || x == aim2) {
          printf("Yes\n");
          cout << p[i][0] << ' ' << p[i][1] << endl;
          cout << p[j][0] << ' ' << p[j][1] << endl;
          cout << p[k][0] << ' ' << p[k][1] << endl;
          return 0;
        }
      }
    }
  }
  printf("No\n");
  return 0;
}
