#include<iostream>

#include<cstdio>

#include<cstring>

#include<algorithm>

#include<string>

#include<vector>

#include<set>

#include<queue>

#include<stack>

#include<cmath>

#define LL long long



using namespace std;

const int N=10005;

const LL INF=0xffffffffffff;//最大

LL ans0[N];//升級(jí)到版本i 且類型為Pirated 最小時(shí)間

LL ans1[N];//升級(jí)到版本i 且類型為非Pirated 的最小時(shí)間

struct node

{

    int x,y,d,k;

}program[N];//升級(jí)程序

bool cmp(node a,node b)

{

    return a.x<b.x;

}

LL Fmin(LL a,LL b)

{

    if(a<b)

    return a;

    return b;

}

void dp(int m)

{

    ans1[1]=0;//初始化

    for(int i=0;i<m;++i)

    {

        int x=program[i].x;

        int y=program[i].y;

        int k=program[i].k;

        int d=program[i].d;

        if(ans0[x]<INF&&k!=2)//更新 k！=2 是因?yàn)長(zhǎng)icensed 不能在Pirated上更新

        {

            ans0[y]=Fmin(ans0[y],ans0[x]+d);

        }

        if(ans1[x]<INF)

        {

            if(k==0)//根據(jù)版本更新

            {ans0[y]=Fmin(ans0[y],ans1[x]+d);}

            else

            {ans1[y]=Fmin(ans1[y],ans1[x]+d);}

        }

    }

}

int main()

{

//   freopen("data","r",stdin);

    int n,m;

    while(scanf("%d %d",&n,&m)!=EOF)

    {

        char stemp[10];

        for(int i=1;i<=n;++i)

        ans0[i]=ans1[i]=INF;

        for(int i=0;i<m;++i)

        {

            scanf("%d %d %d %s",&program[i].x,&program[i].y,&program[i].d,stemp);

            if(stemp[0]=='L')//將不同類型用 數(shù)字表示

            program[i].k=2;

            else if(stemp[0]=='C')

            program[i].k=1;

            else

            program[i].k=0;

        }

        sort(program,program+m,cmp);//按x排序

        dp(m);

        LL ans=Fmin(ans0[n],ans1[n]);//求最優(yōu)

        if(ans==INF)

        printf("Offline\n");

        else

        {

            printf("Online\n");

            cout<<ans<<endl;

        }

    }

    return 0;

}