Problem: One day as Petya and his friend Vasya were having one of their numerous trips, they decided to visit a museum castle. The museum has a specific shape: it consists of n rooms connected with m corridors so that one can access any room from any other one.

After the two friends had a little walk around the museum, they decided to split and watch the pieces of art each of them found interesting. They agreed to meet in one of the rooms at six p.m. However, they forgot one quite essential thing: they didn't specify the place to meet and when the time came, they started to rush about the museum looking for each other (they couldn't call each other as roaming made a call's cost skyrocket).

Yet, even despite the whole rush, they couldn't get enough of the pieces of art, that's why each of them has the following strategy: each minute he make a decision where to go — with probability pi he doesn't move to any other place during this minute (i.e. he stays in the room). With probability 1 - pi he equiprobably choose one of the adjacent rooms and went there along the corridor. Here i is the ordinal number of the current room. Building was expensive in ancient times, that's why each corridor connected two different rooms, and any two rooms had no more than one corridor between them. 

The boys act simultaneously. As the corridors are dark, it is impossible to meet there; however, one can walk along the corridors in both directions (besides, the two boys can be going through the same corridor simultaneously without meeting). The boys act like that until they meet each other. More formally, the two friends meet when at some moment of time both of them decided to appear in the same room.

For each room find the probability that the boys will meet there considering that at 6 p.m. they are positioned in rooms a and b correspondingly.

Input

The first line contains four integers: n (1 ≤ n ≤ 22), representing the numbers of rooms; m <image>, representing the number of corridors; a, b (1 ≤ a, b ≤ n), representing the numbers of Petya's and Vasya's starting rooms correspondingly.

Next m lines contain pairs of numbers — the numbers of rooms connected by a corridor. Next n lines contain probabilities pi (0.01 ≤ pi ≤ 0.99) with the accuracy of up to four digits after the decimal point — the probability to stay in room i.

It is guaranteed that every room can be reached from every other room by corridors.

Output

In the only line print n space-separated numbers, the i-th number should represent the probability that the friends meet in the i-th room with absolute or relative error of no more than 10 - 6.

Examples

Input

2 1 1 2
1 2
0.5
0.5


Output

0.5000000000 0.5000000000 

Input

4 4 1 2
1 2
2 3
3 4
4 1
0.5
0.5
0.5
0.5


Output

0.3333333333 0.3333333333 0.1666666667 0.1666666667 

Note

In the first sample the museum is symmetric. That means the probabilities to meet in rooms 1 and 2 are equal. And their sum equals to one. So, each probability equals 0.5.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int N = 25;
const int inf = 1e9;
const double eps = 1e-8;
int n, m, st, ed, tot, nn;
vector<int> g[N];
double p[N], k[N];
int id[N][N];
typedef double Matrix[N * N][N * N];
double B[N * N][N], ans[N * N][N];
void gauss(Matrix a, int n) {
  for (int i = 0; i <= n - 1; ++i) {
    int rownum = i;
    for (int j = i + 1; j <= n - 1; ++j) {
      if (fabs(a[j][i]) > fabs(a[rownum][i])) rownum = j;
    }
    if (fabs(a[rownum][i]) < eps) continue;
    if (i != rownum) {
      for (int j = 0; j <= n - 1; ++j) swap(a[i][j], a[rownum][j]);
      for (int j = 0; j <= nn - 1; ++j) swap(B[i][j], B[rownum][j]);
    }
    for (int j = i + 1; j <= n - 1; ++j) {
      for (int k = nn - 1; k >= 0; --k) B[j][k] -= a[j][i] / a[i][i] * B[i][k];
      for (int k = n - 1; k >= 0; --k) {
        a[j][k] -= a[j][i] / a[i][i] * a[i][k];
      }
    }
  }
  for (int cur = n - 1; cur >= 0; --cur) {
    for (int i = 0; i <= nn - 1; ++i) {
      for (int j = cur + 1; j <= n - 1; ++j) {
        B[cur][i] -= a[cur][j] * B[j][i];
      }
      B[cur][i] /= a[cur][cur];
    }
    if (cur == id[st][ed]) return;
  }
}
Matrix A;
int main() {
  scanf("%d%d", &n, &m);
  scanf("%d%d", &st, &ed);
  nn = n;
  for (int i = 1; i <= m; ++i) {
    int u, v;
    scanf("%d%d", &u, &v);
    g[u].push_back(v);
    g[v].push_back(u);
  }
  for (int i = 1; i <= n; ++i) {
    scanf("%lf", &p[i]);
    k[i] = (1.0 - p[i]) / g[i].size();
  }
  for (int i = 1; i <= n; ++i)
    for (int j = 1; j <= n; ++j) id[i][j] = tot++;
  for (int i = 1; i <= n; ++i) {
    B[id[i][i]][i - 1] = 1;
  }
  for (int i = 1; i <= n; ++i) {
    for (int j = 1; j <= n; ++j) {
      int cid = id[i][j];
      if (i == j) {
        A[cid][cid] = 1;
        continue;
      }
      A[cid][cid] = 1 - p[i] * p[j];
      for (int v = 0; v <= (int)g[i].size() - 1; ++v) {
        int nid = id[g[i][v]][j];
        A[cid][nid] = -k[i] * p[j];
      }
      for (int v = 0; v <= (int)g[j].size() - 1; ++v) {
        int nid = id[i][g[j][v]];
        A[cid][nid] = -p[i] * k[j];
      }
      for (int i1 = 0; i1 <= (int)g[i].size() - 1; ++i1) {
        for (int i2 = 0; i2 <= (int)g[j].size() - 1; ++i2) {
          int nid = id[g[i][i1]][g[j][i2]];
          A[cid][nid] = -k[i] * k[j];
        }
      }
    }
  }
  gauss(A, n * n);
  for (int i = 0; i <= nn - 1; ++i) {
    printf("%.12f ", B[id[st][ed]][i]);
  }
  return 0;
}