Problem: In Byteland, there are two political parties fighting for seats in the Parliament in the upcoming elections: Wrong Answer Party and Time Limit Exceeded Party. As they want to convince as many citizens as possible to cast their votes on them, they keep promising lower and lower taxes.

There are n cities in Byteland, connected by m one-way roads. Interestingly enough, the road network has no cycles — it's impossible to start in any city, follow a number of roads, and return to that city. Last year, citizens of the i-th city had to pay h_i bourles of tax.

Parties will now alternately hold the election conventions in various cities. If a party holds a convention in city v, the party needs to decrease the taxes in this city to a non-negative integer amount of bourles. However, at the same time they can arbitrarily modify the taxes in each of the cities that can be reached from v using a single road. The only condition that must be fulfilled that the tax in each city has to remain a non-negative integer amount of bourles.

The first party to hold the convention is Wrong Answer Party. It's predicted that the party to hold the last convention will win the election. Can Wrong Answer Party win regardless of Time Limit Exceeded Party's moves?

Input

The first line of the input contains two integers n, m (1 ≤ n ≤ 200 000, 0 ≤ m ≤ 200 000) — the number of cities and roads in Byteland.

The next line contains n space-separated integers h_1, h_2, ..., h_n (0 ≤ h_i ≤ 10^9); h_i denotes the amount of taxes paid in the i-th city.

Each of the following m lines contains two integers (1 ≤ u, v ≤ n, u ≠ v), and describes a one-way road leading from the city u to the city v. There will be no cycles in the road network. No two roads will connect the same pair of cities.

We can show that the conventions cannot be held indefinitely for any correct test case.

Output

If Wrong Answer Party can win the election, output WIN in the first line of your output. In this case, you're additionally asked to produce any convention allowing the party to win regardless of the opponent's actions. The second line should contain n non-negative integers h'_1, h'_2, ..., h'_n (0 ≤ h'_i ≤ 2 ⋅ 10^{18}) describing the amount of taxes paid in consecutive cities after the convention. If there are multiple answers, output any. We guarantee that if the party has any winning move, there exists a move after which no city has to pay more than 2 ⋅ 10^{18} bourles.

If the party cannot assure their victory, output LOSE in the first and only line of the output.

Examples

Input


4 2
2 1 1 5
1 2
3 4


Output


WIN
1 5 1 5 


Input


4 2
1 5 1 5
1 2
3 4


Output


LOSE


Input


3 3
314 159 265
1 2
1 3
3 2


Output


WIN
0 0 0 


Input


6 4
2 2 5 5 6 6
1 3
2 4
3 5
4 6


Output


LOSE

Note

In the first example, Wrong Answer Party should hold the convention in the city 1. The party will decrease the taxes in this city to 1 bourle. As the city 2 is directly reachable from 1, we can arbitrarily modify the taxes in this city. The party should change the tax to 5 bourles. It can be easily proved that Time Limit Exceeded cannot win the election after this move if Wrong Answer Party plays optimally.

The second example test presents the situation we created after a single move in the previous test; as it's Wrong Answer Party's move now, the party cannot win.

In the third test, we should hold the convention in the first city. This allows us to change the taxes in any city to any desired value; we can for instance decide to set all the taxes to zero, which allows the Wrong Answer Party to win the election immediately.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int MaxN = 2e5 + 100;
int stack_sizes[MaxN];
vector<int> adj[MaxN];
int N, M;
int vertex_group_idx[MaxN];
bool visited[MaxN];
int group_xor[MaxN];
vector<int> vertex_groups[MaxN];
void DfsMakeLayers(int vert) {
  visited[vert] = true;
  vector<int> seen_layers;
  for (int s : adj[vert]) {
    if (!visited[s]) {
      DfsMakeLayers(s);
    }
    seen_layers.push_back(vertex_group_idx[s]);
  }
  sort(seen_layers.begin(), seen_layers.end());
  seen_layers.resize(unique(seen_layers.begin(), seen_layers.end()) -
                     seen_layers.begin());
  seen_layers.push_back(1e9);
  while (seen_layers[vertex_group_idx[vert]] == vertex_group_idx[vert]) {
    ++vertex_group_idx[vert];
  }
  const int group_id = vertex_group_idx[vert];
  group_xor[group_id] ^= stack_sizes[vert];
  vertex_groups[group_id].push_back(vert);
}
int main() {
  ios_base::sync_with_stdio(0);
  cin >> N >> M;
  for (int i = 0; i < N; ++i) {
    cin >> stack_sizes[i];
  }
  for (int i = 0; i < M; ++i) {
    int u, v;
    cin >> u >> v;
    --u;
    --v;
    adj[u].push_back(v);
  }
  for (int vert = 0; vert < N; ++vert) {
    if (!visited[vert]) {
      DfsMakeLayers(vert);
    }
  }
  if (count(group_xor, group_xor + N, 0) == N) {
    cout << "LOSE\n";
    return 0;
  }
  int last_idx = N;
  while (group_xor[last_idx] == 0) --last_idx;
  int touched_vertex = -1;
  for (int vert : vertex_groups[last_idx]) {
    if ((stack_sizes[vert] ^ group_xor[last_idx]) < stack_sizes[vert]) {
      touched_vertex = vert;
      break;
    }
  }
  assert(touched_vertex != -1);
  stack_sizes[touched_vertex] ^= group_xor[last_idx];
  group_xor[last_idx] = 0;
  for (int neigh : adj[touched_vertex]) {
    const int group_idx = vertex_group_idx[neigh];
    stack_sizes[neigh] ^= group_xor[group_idx];
    group_xor[group_idx] = 0;
  }
  assert(count(group_xor, group_xor + N, 0) == N);
  cout << "WIN\n";
  for (int i = 0; i < N; ++i) cout << stack_sizes[i] << " ";
  cout << "\n";
}