Problem: A Die Maker

The work of die makers starts early in the morning.

You are a die maker. You receive orders from customers, and make various kinds of dice every day. Today, you received an order of a cubic die with six numbers t1, t2, ..., t6 on whichever faces.

For making the ordered die, you use a tool of flat-board shape. You initially have a die with a zero on each face. If you rotate the die by 90 degrees on the tool towards one of northward, southward, eastward, and southward, the number on the face that newly touches the tool is increased by one. By rotating the die towards appropriate directions repeatedly, you may obtain the ordered die.

The final numbers on the faces of the die is determined by the sequence of directions towards which you rotate the die. We call the string that represents the sequence of directions an operation sequence. Formally, we define operation sequences as follows. An operation sequence consists of n characters, where n is the number of rotations made. If you rotate the die eastward in the i-th rotation, the i-th character of the operation sequence is `E`. Similarly, if you rotate it westward, it is `W`, if southward, it is `S`, otherwise, if northward, it is `N`. For example, the operation sequence `NWS` represents the sequence of three rotations, northward first, westward next, and finally southward.

Given six integers of the customer's order, compute an operation sequence that makes a die to order. If there are two or more possibilities, you should compute the earliest operation sequence in dictionary order.

Input

The input consists of multiple datasets. The number of datasets does not exceed 40. Each dataset has the following form.

> t1 t2 t3 t4 t5 t6
>  p q

t1, t2, ..., t6 are integers that represent the order from the customer. Further, p and q are positive integers that specify the output range of the operation sequence (see the details below).

Each dataset satisfies 0 ≤ t1 ≤ t2 ≤ ... ≤ t6 ≤ 5,000 and 1 ≤ p ≤ q ≤ t1+t2+...+t6. A line containing six zeros denotes the end of the input.

Output

For each dataset, print the subsequence, from the p-th position to the q-th position, inclusively, of the operation sequence that is the earliest in dictionary order. If it is impossible to make the ordered die, print `impossible`.

Here, dictionary order is recursively defined as follows. The empty string comes the first in dictionary order. For two nonempty strings x = x1 ... xk and y = y1 ... yl, the string x precedes the string y in dictionary order if

* x1 precedes y1 in alphabetical order ('A' to 'Z'), or
* x1 and y1 are the same character and x2 ... xk precedes y2 ... yl in dictionary order.



Sample Input


1 1 1 1 1 1
1 6
1 1 1 1 1 1
4 5
0 0 0 0 0 2
1 2
0 0 2 2 2 4
5 9
1 2 3 4 5 6
15 16
0 1 2 3 5 9
13 16
2 13 22 27 31 91
100 170
0 0 0 0 0 0


Output for the Sample Input


EEENEE
NE
impossible
NSSNW
EN
EWNS
SNSNSNSNSNSNSNSNSNSNSNSSNSNSNSNSNSNSNSNSNSNSNSNSNSNSNSNSNSNSNSNSNSNWEWE






Example

Input

1 1 1 1 1 1
1 6
1 1 1 1 1 1
4 5
0 0 0 0 0 2
1 2
0 0 2 2 2 4
5 9
1 2 3 4 5 6
15 16
0 1 2 3 5 9
13 16
2 13 22 27 31 91
100 170
0 0 0 0 0 0


Output

EEENEE
NE
impossible
NSSNW
EN
EWNS
SNSNSNSNSNSNSNSNSNSNSNSSNSNSNSNSNSNSNSNSNSNSNSNSNSNSNSNSNSNSNSNSNSNWEWE

Solution (in CPP):

Solution:
#include<bits/stdc++.h>
using namespace std;

enum DIE {TOP, FRONT, RIGHT, LEFT, BACK, BOTTOM};
enum DIR {E, N, S, W, CLOCKWISE};

void rotate(vector<int>& die, DIR dir) {
  if(dir == E) {
    swap(die[TOP], die[RIGHT]);
    swap(die[TOP], die[BOTTOM]);
    swap(die[TOP], die[LEFT]);
  }
  if(dir == N) {
    swap(die[TOP], die[BACK]);
    swap(die[TOP], die[BOTTOM]);
    swap(die[TOP], die[FRONT]);
  }
  if(dir == S) {
    swap(die[TOP], die[FRONT]);
    swap(die[TOP], die[BOTTOM]);
    swap(die[TOP], die[BACK]);
  }
  if(dir == W) {
    swap(die[TOP], die[LEFT]);
    swap(die[TOP], die[BOTTOM]);
    swap(die[TOP], die[RIGHT]);
  }
  --die[BOTTOM];
}

bool possible(vector<int> die, DIR dir, int sum) {
  rotate(die, dir);
  --sum;
  if(die[BOTTOM] < 0) return false;
  if(sum == 1) return die[TOP] == 0 && die[BOTTOM] == 0;
  int fb = die[FRONT] + die[BACK];
  int tb = die[TOP] + die[BOTTOM];
  int lr = die[LEFT] + die[RIGHT];
  return fb <= sum - fb + 1 && lr <= sum - lr + 1 && tb <= sum - tb;
}

void greedy(char res[30000 + 1], vector<int> die) {
  res[0] = 'X';
  res[1] = '\0';
  int size = 0;
  int sum = accumulate(begin(die), end(die), 0);
  if(!possible(die, E, sum)) {
    res[0] = 'X';
    res[1] = '\0';
    return;
  }
  while(0 < sum) {
    for(auto dir: {E, N, S, W}) if(possible(die, dir, sum)) {
      rotate(die, dir);
      --sum;
      if(dir == E)      res[size++] = 'E';
      else if(dir == N) res[size++] = 'N';
      else if(dir == S) res[size++] = 'S';
      else if(dir == W) res[size++] = 'W';
      break;
    }
  }
  res[size] = '\0';
}

int main() {
  while(true) {
    vector<int> t(6);
    for(auto& i: t) cin >> i;
    if(all_of(begin(t), end(t), [](int i){return i == 0;})) break;

    char ans[30000 + 1], res[30000 + 1];
    ans[0] = 'X';
    ans[1] = '\0';
    sort(begin(t), end(t));
    do {
      greedy(res, t);
      if(strcmp(res, ans) < 0) swap(ans, res);
    } while(next_permutation(begin(t), end(t)));

    int p, q;
    cin >> p >> q;
    if(ans[0] == 'X') printf("impossible\n");
    else              {for(int i = p - 1; i < q; ++i) putchar(ans[i]); puts("");}
  }
}