#include <bits/stdc++.h>
using namespace std;
const long long N = 100005;
const long long M = 1000000007;
void dfs(long long st, vector<vector<long long> > &v, vector<bool> &vis,
         vector<long long> &v3, long long vi) {
  vis[st] = true;
  for (long long i = 0; i < v[st].size(); i++) {
    if (vis[v[st][i]]) continue;
    dfs(v[st][i], v, vis, v3, 0);
    vi += v3[v[st][i]];
  }
  vi++;
  v3[st] = vi;
  return;
}
long long pow1(long long a, long long b, long long mod) {
  int res = 1;
  if (b < 0) b += mod - 1;
  while (b > 0) {
    if (b & 1) {
      res = (res * a) % mod;
    }
    a = (a * a) % mod;
    b >>= 1;
  }
  return res % mod;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long no = 1;
  for (long long w = 0; w < no; w++) {
    long long n, s;
    cin >> n >> s;
    if (n > (s / 2))
      cout << "NO" << endl;
    else {
      cout << "YES" << endl;
      for (long long i = 0; i < n - 1; i++) cout << 1 << " ";
      cout << s - n + 1 << endl;
      cout << s / 2 << endl;
    }
  }
  return 0;
}
