Problem: Vasya has a graph containing both directed (oriented) and undirected (non-oriented) edges. There can be multiple edges between a pair of vertices.

Vasya has picked a vertex s from the graph. Now Vasya wants to create two separate plans:

  1. to orient each undirected edge in one of two possible directions to maximize number of vertices reachable from vertex s; 
  2. to orient each undirected edge in one of two possible directions to minimize number of vertices reachable from vertex s. 



In each of two plans each undirected edge must become directed. For an edge chosen directions can differ in two plans.

Help Vasya find the plans.

Input

The first line contains three integers n, m and s (2 ≤ n ≤ 3·105, 1 ≤ m ≤ 3·105, 1 ≤ s ≤ n) — number of vertices and edges in the graph, and the vertex Vasya has picked.

The following m lines contain information about the graph edges. Each line contains three integers ti, ui and vi (1 ≤ ti ≤ 2, 1 ≤ ui, vi ≤ n, ui ≠ vi) — edge type and vertices connected by the edge. If ti = 1 then the edge is directed and goes from the vertex ui to the vertex vi. If ti = 2 then the edge is undirected and it connects the vertices ui and vi.

It is guaranteed that there is at least one undirected edge in the graph.

Output

The first two lines should describe the plan which maximizes the number of reachable vertices. The lines three and four should describe the plan which minimizes the number of reachable vertices.

A description of each plan should start with a line containing the number of reachable vertices. The second line of a plan should consist of f symbols '+' and '-', where f is the number of undirected edges in the initial graph. Print '+' as the j-th symbol of the string if the j-th undirected edge (u, v) from the input should be oriented from u to v. Print '-' to signify the opposite direction (from v to u). Consider undirected edges to be numbered in the same order they are given in the input.

If there are multiple solutions, print any of them.

Examples

Input

2 2 1
1 1 2
2 2 1


Output

2
-
2
+


Input

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


Output

6
++-
2
+-+

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int maxn = 3e5 + 10;
struct Edge {
  int u, v, type, idx;
};
vector<Edge> edges;
vector<int> G[maxn], need;
int n, m, s, cnt, ud;
bool vis[maxn], vism[maxn];
int ans[maxn];
void dfs1(int u) {
  vis[u] = true;
  cnt++;
  for (int i = 0; i < G[u].size(); i++) {
    Edge e = edges[G[u][i]];
    if (e.type == 1) {
      int nx = e.u ^ e.v ^ u;
      if (!vis[nx]) dfs1(nx);
    } else {
      if (e.u == u)
        ans[e.idx] = -1;
      else
        ans[e.idx] = +1;
    }
  }
}
void dfs2(int u) {
  vis[u] = true;
  cnt++;
  for (int i = 0; i < G[u].size(); i++) {
    Edge e = edges[G[u][i]];
    int nx = e.u ^ e.v ^ u;
    if (e.type == 2 && !vism[e.idx]) {
      vism[e.idx] = true;
      if (e.u == u)
        ans[e.idx] = +1;
      else
        ans[e.idx] = -1;
    }
    if (!vis[nx]) dfs2(nx);
  }
}
int main() {
  scanf("%d%d%d", &n, &m, &s);
  for (int i = 0; i < m; i++) {
    int u, v, w;
    scanf("%d%d%d", &w, &u, &v);
    if (w == 2) {
      need.push_back(i);
      ud++;
      edges.push_back({u, v, w, i});
      G[u].push_back(edges.size() - 1);
      G[v].push_back(edges.size() - 1);
    } else {
      edges.push_back({u, v, w, i});
      G[u].push_back(edges.size() - 1);
    }
  }
  dfs2(s);
  printf("%d\n", cnt);
  for (int i = 0; i < need.size(); i++) {
    if (ans[need[i]] == 0)
      printf("+");
    else
      printf("%c", ans[need[i]] == -1 ? '-' : '+');
  }
  puts("");
  memset(vism, false, sizeof(vism));
  memset(ans, 0, sizeof(ans));
  memset(vis, false, sizeof(vis));
  cnt = 0;
  dfs1(s);
  printf("%d\n", cnt);
  for (int i = 0; i < need.size(); i++) {
    if (ans[need[i]] == 0)
      printf("+");
    else
      printf("%c", ans[need[i]] == -1 ? '-' : '+');
  }
  return 0;
}