1 /*
  2     WA了4，5发，第一是抄Kuangbin的模板抄错了；第二是选取的INF值太小了
  3     以后学习一下最值的选取的方法:)
  4 */
  5 #include <cstdio>
  6 #include <iostream>
  7 #include <algorithm>
  8 #include <cstring>
  9 #include <vector>
 10 #include <cmath>
 11 #include <queue>
 12 using namespace std;
 13
 14 const int MAXN = 1e4 + 10;
 15 const int INF = 0x3f3f3f3f;
 16 const int INFF = 0x7fffffff;
 17 const long long inf = ((long long)1<<50);
 18 struct Edge
 19 {
 20     int v, w;
 21     int f;
 22     Edge (int _v = 0, int _w = 0, int _f = 0) : v (_v), w (_w), f (_f) {}
 23 };
 24 bool vis[MAXN];
 25 int cnt[MAXN];
 26 long long d[MAXN][2];
 27 vector<Edge> G[MAXN];
 28 int n, m;
 29
 30 void add_edge(int u, int v, int w, int f)
 31 {
 32     G[u].push_back (Edge (v, w, f));
 33 }
 34
 35 bool SPFA(int s)
 36 {
 37     memset (cnt, 0, sizeof (cnt));
 38     memset (vis, false, sizeof (vis));
 39     for (int i=1; i<=n; ++i)    d[i][0] = d[i][1] = inf;
 40     vis[s] = true;    d[s][0] = 0;    cnt[s] = 1;
 41
 42     queue<int> Q;    Q.push (s);
 43     while (!Q.empty ())
 44     {
 45         int u = Q.front ();    Q.pop ();
 46         vis[u] = false;                        //失误！
 47         for (int i=0; i<G[u].size (); ++i)
 48         {
 49             int v = G[u][i].v;    int w = G[u][i].w;    int f = G[u][i].f;
 50             if (f == 0)
 51             {
 52                 if (d[v][0] > d[u][0] + w)    d[v][0] = d[u][0] + w;
 53             }
 54             else if (f == 1)
 55             {
 56                 if (d[v][1] > d[u][0] + w)    d[v][1] = d[u][0] + w;
 57                 if (d[v][1] > d[u][1] + w)    d[v][1] = d[u][1] + w;
 58             }
 59             else
 60             {
 61                 if (d[v][0] > d[u][0] + w)    d[v][0] = d[u][0] + w;
 62                 if (d[v][1] > d[u][1] + w)    d[v][1] = d[u][1] + w;
 63             }
 64             if (!vis[v])
 65             {
 66                 vis[v] = true;    Q.push (v);
 67                 if (++cnt[v] > n)    return true;
 68             }
 69         }
 70     }
 71
 72     return false;
 73 }
 74
 75 int main(void)        //URAL 1741 Communication Fiend
 76 {
 77     //freopen ("T.in", "r", stdin);
 78
 79     while (scanf ("%d%d", &n, &m) == 2)
 80     {
 81         for (int i=1; i<=n; ++i)    G[i].clear ();
 82         for (int i=1; i<=m; ++i)
 83         {
 84             int u, v, w, f;    char s[10];
 85             scanf ("%d %d %d %s", &u, &v, &w, &s);
 86             if (s[0] == 'L')    f = 0;
 87             else if (s[0] == 'P')    f = 1;
 88             else if (s[0] == 'C')    f = -1;
 89             add_edge (u, v, w, f);
 90         }
 91
 92         if (!SPFA (1))
 93         {
 94             long long ans = min (d[n][0], d[n][1]);
 95             if (ans == inf)    puts ("Offline");
 96             else    {puts ("Online");    printf ("%I64d\n", ans);}
 97         }
 98     }
 99
100     return 0;
101 }
102
103 /*
104 Online
105 Offline
106 */