#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;
}
