#include <bits/stdc++.h>
using namespace std;
template <typename T>
T gcd(T a, T b) {
  if (a == 0) return b;
  return gcd(b % a, a);
}
template <typename T>
T pow(T a, T b, long long m) {
  T ans = 1;
  while (b > 0) {
    if (b % 2 == 1) ans = (ans * a) % m;
    b /= 2;
    a = (a * a) % m;
  }
  return ans % m;
}
const int N = 3e5 + 5;
struct data {
  int u, v, t;
};
int n, m, s, ans1 = 0, ans2 = 0;
int vis[N];
data store[N];
vector<pair<int, int> > g[N];
map<pair<int, int>, char> m1;
map<pair<int, int>, char> m2;
void bfs1() {
  int source = s;
  queue<int> q;
  q.push(source);
  vis[source] = 1;
  ans1 = 1;
  while (!q.empty()) {
    int top = q.front();
    q.pop();
    for (auto it : g[top]) {
      if (vis[it.first]) continue;
      vis[it.first] = 1;
      if (it.second == 1) {
        q.push(it.first);
      } else {
        q.push(it.first);
        m1[make_pair(top, it.first)] = '+';
        m1[make_pair(it.first, top)] = '-';
      }
      ans1++;
    }
  }
}
void bfs2() {
  memset(vis, 0, sizeof(vis));
  int source = s;
  queue<int> q;
  q.push(source);
  vis[source] = 1;
  ans2 = 1;
  while (!q.empty()) {
    int top = q.front();
    q.pop();
    for (auto it : g[top]) {
      if (vis[it.first]) continue;
      if (it.second == 1) {
        vis[it.first] = 1;
        q.push(it.first);
        ans2++;
      } else {
        m2[make_pair(top, it.first)] = '-';
      }
    }
  }
}
int32_t main() {
  cin >> n >> m >> s;
  for (int i = 1; i <= m; i++) {
    int u, v, t;
    cin >> t >> u >> v;
    store[i].u = u;
    store[i].v = v;
    store[i].t = t;
    if (t == 1) {
      g[u].push_back(make_pair(v, t));
    } else {
      m1[make_pair(u, v)] = '+';
      m1[make_pair(v, u)] = '-';
      m2[make_pair(u, v)] = '+';
      m2[make_pair(v, u)] = '-';
      g[u].push_back(make_pair(v, t));
      g[v].push_back(make_pair(u, t));
    }
  }
  bfs1();
  cout << ans1 << "\n";
  for (int i = 1; i <= m; i++) {
    if (store[i].t == 1) continue;
    char ch = m1[make_pair(store[i].u, store[i].v)];
    cout << ch;
  }
  cout << "\n";
  bfs2();
  cout << ans2 << "\n";
  for (int i = 1; i <= m; i++) {
    if (store[i].t == 1) continue;
    char ch = m2[make_pair(store[i].u, store[i].v)];
    cout << ch;
  }
}
