Problem: You are given the following concurrent program. There are N processes and the i-th process has the following pseudocode: 
    
    
    repeat ni times  
        yi := y  
        y := yi + 1  
    end repeat  
    

Here y is a shared variable. Everything else is local for the process. All actions on a given row are atomic, i.e. when the process starts executing a row it is never interrupted. Beyond that all interleavings are possible, i.e. every process that has yet work to do can be granted the rights to execute its next row. In the beginning y = 0. You will be given an integer W and ni, for i = 1, ... , N. Determine if it is possible that after all processes terminate, y = W, and if it is possible output an arbitrary schedule that will produce this final value.

Input

In the first line of the input you will be given two space separated integers N (1 ≤ N ≤ 100) and W ( - 109 ≤ W ≤ 109). In the second line there are N space separated integers ni (1 ≤ ni ≤ 1000).

Output

On the first line of the output write Yes if it is possible that at the end y = W, or No otherwise. If the answer is No then there is no second line, but if the answer is Yes, then on the second line output a space separated list of integers representing some schedule that leads to the desired result. For more information see note.

Examples

Input

1 10
11


Output

No


Input

2 3
4 4


Output

Yes
1 1 2 1 2 2 2 2 2 1 2 1 1 1 1 2


Input

3 6
1 2 3


Output

Yes
1 1 2 2 2 2 3 3 3 3 3 3

Note

For simplicity, assume that there is no repeat statement in the code of the processes, but the code from the loop is written the correct amount of times. The processes are numbered starting from 1. The list of integers represent which process works on its next instruction at a given step. For example, consider the schedule 1 2 2 1 3. First process 1 executes its first instruction, then process 2 executes its first two instructions, after that process 1 executes its second instruction, and finally process 3 executes its first instruction. The list must consists of exactly 2·Σ i = 1...N ni numbers.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
int w;
int sum = 0;
int value = 0;
vector<int> nums;
vector<int> ans;
struct Saver {
  int index;
  int save;
  Saver(int i) : index(i) {
    ans.push_back(index);
    save = ::value;
  }
  ~Saver() {
    ans.push_back(index);
    ::value = save + 1;
    --nums[index];
  }
};
void spend_to(int i, int dst) {
  int &value = nums[i];
  while (value > dst) {
    Saver s(i);
  }
}
void spend_careful(int i, int dst, int &care) {
  int &value = nums[i];
  while (care > 0 && value > dst) {
    Saver s(i);
    --care;
  }
}
bool solve() {
  if (nums.size() == 1) {
    if (nums[0] == w) {
      spend_to(0, 0);
      return true;
    } else
      return false;
  } else if (w == 1) {
    vector<int>::iterator id_1 = std::find(nums.begin(), nums.end(), 1);
    if (id_1 != nums.end()) {
      int i1 = id_1 - nums.begin();
      {
        Saver s(i1);
        for (int i = 0; i < nums.size(); i++)
          if (i != i1) spend_to(i, 0);
      }
      return true;
    } else
      return false;
  } else {
    if (sum < w || w < 2) return false;
    int need = w - 2;
    int need0 = min(nums[0] - 1, need);
    need -= need0;
    int to_spend = sum - nums[0] - need - 1;
    {
      Saver s(0);
      spend_careful(1, 1, to_spend);
      for (int i = 2; i < nums.size(); ++i) spend_careful(i, 0, to_spend);
    }
    {
      Saver s(1);
      spend_to(0, need0);
    }
    for (int i = 0; i < nums.size(); i++) spend_to(i, 0);
    return true;
  }
}
int main() {
  int n;
  scanf("%d%d", &n, &w);
  nums.resize(n);
  for (int i = 0; i < n; i++) {
    scanf("%d", &nums[i]);
    sum += nums[i];
  }
  if (solve()) {
    printf("Yes\n");
    for (int i = 0; i < ans.size(); i++) {
      printf("%d ", ans[i] + 1);
    }
    printf("\n");
    assert(value == w);
  } else {
    printf("No\n");
  }
  return 0;
}