#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>

int descending_compare(const void *a, const void *b){
    if (*(long long*)a > *(long long*)b){
        return -1;
    }else if (*(long long*)a == *(long long*)b){
        return 0;
    }else{
        return 1;
    }
}

int ascending_compare(const void *a, const void *b){
    if (*(int*)a < *(int*)b){
        return -1;
    }else if (*(int*)a == *(int*)b){
        return 0;
    }else{
        return 1;
    }
}


int lower_bound(int *a, int n, int key){
    int left, mid, right;
    left = 0, right = n;
    mid = (left + right)/2;
    while ((left+1 != mid || mid+1 != right) && mid != left){
        if (key > a[mid]){
            left = mid;
        }else{
            right = mid+1;
        }
        mid = (left + right)/2;
    }
    if (a[left] >= key)return left;
    if (a[mid] >= key)return mid;
    if (a[right] >= key)return right;
    return n;
}

//greatest common divisor
unsigned long gcd(unsigned long x, unsigned long y){
    if (y == 0){ 
        return x;
    }else if (x > y){
        return gcd(y, x % y);
    }else{
        return gcd(x, y % x);
    }
}

unsigned long lcm(unsigned long x, unsigned long y){
    unsigned long g = gcd(x, y);
    return x*y/g;

}



long long factorial(int x){
    long long rtn = 1;
    int i;
    for (i = x; i > 1; i--){
        rtn = (rtn*i);
    }
    return rtn;
}

/*
int struct_ascending_compare(const void *p, const void *q) {
return ((struct_name*)p)->member_name - ((struct_name*)q)->member_name;
}*/

/*unsigned long long pascal[100][100] = {0};
void make_pascal(void){
    for (int i = 0; i < 100; i++){
        pascal[i][0] = 1;
    }
    pascal[1][1] = 1;
    for (int i = 2; i < 100; i++){
        for (int j = 1; j < 100; j++){
           pascal[i][j] = (pascal[i-1][j-1]+pascal[i-1][j]);
        }
    }
}*/
int head[1005];
int next[2005];
int to[2005];
int weight[2005];
long long v[1005] = {0};
int vb[1005] = {0};
int n, m;
int vton[1005] = {0};
int first_to_v[1005] = {0};
int closed[1005] = {0};
int start;

int dfs(int crt){
    int edge = head[crt];
    while (edge != -1){
        if (vb[to[edge]] != 1 && v[to[edge]] < v[crt] + weight[edge]){
            v[to[edge]] = v[crt] + weight[edge];
            vb[to[edge]] = 1;
            dfs(to[edge]);
        }
        edge = next[edge];
    }
    vb[crt] = 0;
    return 0;
}


int check_closed(int crt){
    int edge = head[crt];
    while (edge != -1){
        if ((to[edge] == start || vb[to[edge]] != 1) && v[to[edge]] < v[crt] + weight[edge]){
            v[to[edge]] = v[crt] + weight[edge];
            vb[to[edge]]++;
            check_closed(to[edge]);
        }
        edge = next[edge];  
    }
    vb[crt]--;
    return 0;
}


int main(void){
    for (int i = 0; i < 1005; i++){
        head[i] = -1;
    }
    scanf("%d %d", &n, &m);
    long long a, b, c;
    long long ans;
    for (int i = 0; i < m; i++){
        scanf("%lld %lld %lld", &a, &b, &c);
        next[i] = head[a];
        head[a] = i;
        to[i] = b;
        weight[i] = c;
    }
    for (int i = n; i > 0; i--){
        for (int j = 0; j <= n; j++){
            v[j] = -1000000000000000;
            vb[j] = 0;
        }
        v[i] = 0;
        vb[i] = 1;
        dfs(i);
        if (v[n] != -1000000000000000) vton[i] = 1;
    }
    for (int i = 1; i <= n; i++){
        if (v[i] != -1000000000000000){
            first_to_v[i] = 1;
        }
    }
    ans = v[n];
    vton[1] = 1;
    first_to_v[1] = 1;
    for (int i = 1; i <= n; i++){
        if (vton[i] == 1 && first_to_v[i] == 1){
            for (int j = 0; j <= n; j++){
                v[j] = -1000000000000000;
                vb[j] = 0;
            }
            v[i] = 0;
            vb[i] = 1;
            start = i;
            check_closed(i);
            if (v[i] > 0){
                printf("inf\n");
                return 0;
            }
        }
    }
    printf("%lld\n", ans);
    return 0;
}


Measured memory_bytes: 256