func_code_string: #include <bits/stdc++.h>   using namespace std;   int n, m, tot, X, Y, a[25][25], d[25], id[25][25];   double p[25], b[500][2], c[500][500], ans[25];   void work() {     scanf( %d %d %d %d , &n, &m, &X, &Y);     if (X == Y) {       for (int i = 1; i <= n; i++) printf( %.10lf  , 1.0 * int(i == X));       return;     }     for (int i = 1, x, y; i <= m; i++)       scanf( %d %d , &x, &y), a[x][y] = a[y][x] = 1, d[x]++, d[y]++;     for (int i = 1; i <= n; i++) scanf( %lf , &p[i]);     for (int i = 1; i <= n; i++)       for (int j = i; j <= n; j++) id[i][j] = id[j][i] = ++tot;     for (int i = 1; i <= n; i++)       for (int j = i + 1; j <= n; j++) {         int x = id[i][j];         double q = 1 - p[i] * p[j];         for (int k = 1; k <= n; k++)           if (a[i][k])             for (int l = 1; l <= n; l++)               if (a[j][l])                 c[x][id[k][l]] += (1 - p[i]) * (1 - p[j]) / d[i] / d[j] / q;         for (int k = 1; k <= n; k++)           if (a[i][k]) c[x][id[k][j]] += (1 - p[i]) * p[j] / d[i] / q;         for (int k = 1; k <= n; k++)           if (a[j][k]) c[x][id[i][k]] += p[i] * (1 - p[j]) / d[j] / q;       }     b[id[X][Y]][0] = 1;     for (int T = 5000; T; T--) {       for (int i = 1; i <= tot; i++)         for (int j = 1; j <= tot; j++) b[j][1] += b[i][0] * c[i][j];       for (int i = 1; i <= tot; i++) b[i][0] = b[i][1], b[i][1] = 0;       for (int i = 1; i <= n; i++) ans[i] += b[id[i][i]][0];     }     for (int i = 1; i <= n; i++) printf( %.10lf  , ans[i]);   }   int main() {     work();     return 0;   }   