#include <bits/stdc++.h>
using namespace std;
long long int mod = 1000000007;
long long int powmod(long long int x, long long int y, long long int p) {
  int res = 1;
  x = x % p;
  while (y > 0) {
    if (y & 1) res = (res * x) % p;
    y = y >> 1;
    x = (x * x) % p;
  }
  return res;
}
long long int power(long long int x, long long int y) {
  long long int temp;
  if (y == 0) return 1;
  temp = power(x, y / 2);
  if (y % 2 == 0)
    return temp * temp;
  else
    return x * temp * temp;
}
long long int gcd(long long int a, long long int b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long int lcm(long long int a, long long int b) {
  return (a * b) / gcd(a, b);
}
bool isprime(long long int a) {
  if (a <= 1) return 0;
  if (a <= 3) return 1;
  if (a % 2 == 0 || a % 3 == 0) return 0;
  for (long long int i = 5; i * i <= a; i += 6) {
    if (a % i == 0 || a % (i + 2) == 0) return 0;
  }
  return 1;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long int n, s;
  cin >> n >> s;
  long long int y = 2 * n;
  if (y > s)
    cout << "NO";
  else {
    cout << "YES" << endl;
    for (long long int i = 0; i < n - 1; i++) cout << 2 << " ";
    cout << s - (2) * (n - 1);
    cout << endl;
    cout << 1;
  }
  return 0;
}
