#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
int main() {
  long long n, s;
  cin >> n >> s;
  long long k;
  k = s / 2;
  if (s < 2 * n)
    cout << "NO"
         << "\n";
  else {
    cout << "YES"
         << "\n";
    for (long long i = 0; i < n - 1; i++) {
      cout << "1 ";
    }
    cout << s - (n - 1) << "\n";
    cout << k;
  }
  return 0;
}
