#include <bits/stdc++.h>
using namespace std;
long long powmod(long long a, long long b) {
  long long res = 1;
  a %= 1000000007;
  for (; b; b >>= 1) {
    if (b & 1) res = res * a % 1000000007;
    a = a * a % 1000000007;
  }
  return res;
}
int gcd(int x, int y) {
  while (y) {
    int t = x % y;
    x = y;
    y = t;
  }
  return x;
}
template <typename T>
inline bool chkmin(T &a, const T &b) {
  return a > b ? a = b, 1 : 0;
}
template <typename T>
inline bool chkmax(T &a, const T &b) {
  return a < b ? a = b, 1 : 0;
}
namespace FastIO {
bool IOError = 0;
inline char NextChar() {
  static char buf[100000], *p1 = buf + 100000, *pend = buf + 100000;
  if (p1 == pend) {
    p1 = buf;
    pend = buf + fread(buf, 1, 100000, stdin);
    if (pend == p1) {
      IOError = 1;
      return -1;
    }
  }
  return *p1++;
}
inline bool Blank(char c) {
  return c == ' ' || c == '\n' || c == '\r' || c == '\t';
}
inline void read(int &x) {
  bool sign = 0;
  char ch = NextChar();
  x = 0;
  for (; Blank(ch); ch = NextChar())
    ;
  if (IOError) return;
  if (ch == '-') sign = 1, ch = NextChar();
  for (; ch >= '0' && ch <= '9'; ch = NextChar()) x = x * 10 + ch - '0';
  if (sign) x = -x;
}
inline void read(long long &x) {
  bool sign = 0;
  char ch = NextChar();
  x = 0;
  for (; Blank(ch); ch = NextChar())
    ;
  if (IOError) return;
  if (ch == '-') sign = 1, ch = NextChar();
  for (; ch >= '0' && ch <= '9'; ch = NextChar()) x = x * 10 + ch - '0';
  if (sign) x = -x;
}
inline void read(double &x) {
  bool sign = 0;
  char ch = NextChar();
  x = 0;
  for (; Blank(ch); ch = NextChar())
    ;
  if (IOError) return;
  if (ch == '-') sign = 1, ch = NextChar();
  for (; ch >= '0' && ch <= '9'; ch = NextChar()) x = x * 10 + ch - '0';
  if (ch == '.') {
    double tmp = 1;
    ch = NextChar();
    for (; ch >= '0' && ch <= '9'; ch = NextChar())
      tmp /= 10.0, x += tmp * (ch - '0');
  }
  if (sign) x = -x;
}
inline void read(char *s) {
  char ch = NextChar();
  for (; Blank(ch); ch = NextChar())
    ;
  if (IOError) return;
  for (; !Blank(ch) && !IOError; ch = NextChar()) *s++ = ch;
  *s = 0;
}
inline void read(char &c) {
  for (c = NextChar(); Blank(c); c = NextChar())
    ;
  if (IOError) {
    c = -1;
    return;
  }
}
}  // namespace FastIO
using namespace FastIO;
struct node {
  int u, typ, id;
  node() {}
  node(int u, int t, int i) : u(u), typ(t), id(i) {}
};
vector<node> g[601000];
int ans[601000], vis[601000], typ[601000], tot;
void dfs1(int u) {
  tot++;
  vis[u] = 1;
  for (node x : g[u]) {
    if (vis[x.u]) continue;
    ans[x.id] = x.typ;
    dfs1(x.u);
  }
}
void dfs2(int u) {
  tot++;
  vis[u] = 1;
  for (node x : g[u]) {
    if (vis[x.u]) continue;
    if (x.typ != 2) {
      ans[x.id] = x.typ ^ 1;
    } else
      dfs2(x.u);
  }
}
int main() {
  int n, m, s;
  read(n), read(m), read(s);
  for (int i = 0; i < m; i++) {
    int u, v;
    read(typ[i]), read(u), read(v);
    if (typ[i] == 1)
      g[u].push_back(node(v, 2, i));
    else {
      g[u].push_back(node(v, 0, i));
      g[v].push_back(node(u, 1, i));
    }
  }
  memset(vis, 0, sizeof vis);
  dfs1(s);
  printf("%d\n", tot);
  for (int i = 0; i < m; i++) {
    if (typ[i] == 2) printf("%c", ans[i] ? '-' : '+');
  }
  puts("");
  tot = 0;
  memset(vis, 0, sizeof vis);
  dfs2(s);
  printf("%d\n", tot);
  for (int i = 0; i < m; i++) {
    if (typ[i] == 2) printf("%c", ans[i] ? '-' : '+');
  }
  puts("");
  return 0;
}
