#include <bits/stdc++.h>
using namespace std;
vector<pair<int, int> > V[300005];
map<pair<int, int>, int> M;
map<pair<int, int>, int> N;
vector<pair<int, int> > Edge;
bool vis[300005];
bool vis2[300005];
int cnt1;
int cnt2;
void dfs1(int n) {
  if (vis[n]) return;
  vis[n] = 1;
  ++cnt1;
  for (int i = 0; i < V[n].size(); ++i) {
    int u = V[n][i].first;
    int t = V[n][i].second;
    if (t == 1) {
      dfs1(u);
    } else if (M.find(make_pair(u, n)) == M.end() &&
               M.find(make_pair(n, u)) == M.end()) {
      M[make_pair(u, n)] = 1;
    }
  }
}
void dfs2(int n) {
  if (vis2[n]) return;
  vis2[n] = 1;
  ++cnt2;
  for (int i = 0; i < V[n].size(); ++i) {
    int u = V[n][i].first;
    int t = V[n][i].second;
    if (t == 1) {
      dfs2(u);
    } else if (N.find(make_pair(u, n)) == N.end() &&
               N.find(make_pair(n, u)) == N.end()) {
      N[make_pair(n, u)] = 1;
      dfs2(u);
    }
  }
}
int main() {
  int n, m, s;
  cin >> n >> m >> s;
  for (int i = 1; i <= m; ++i) {
    int a, b, t;
    scanf("%d %d %d", &t, &a, &b);
    V[a].push_back(make_pair(b, t));
    if (t == 2) {
      V[b].push_back(make_pair(a, t));
      Edge.push_back(make_pair(a, b));
    }
  }
  dfs1(s);
  dfs2(s);
  cout << cnt2 << endl;
  for (int i = 0; i < Edge.size(); ++i) {
    int u = Edge[i].first;
    int v = Edge[i].second;
    if (N.find(make_pair(u, v)) != N.end())
      printf("+");
    else
      printf("-");
  }
  cout << endl;
  cout << cnt1 << endl;
  for (int i = 0; i < Edge.size(); ++i) {
    int u = Edge[i].first;
    int v = Edge[i].second;
    if (M.find(make_pair(u, v)) != M.end())
      printf("+");
    else
      printf("-");
  }
  return 0;
}
