#include <algorithm>

#include <bitset>

#include <cctype>

#include <cerrno>

#include <clocale>

#include <cmath>

#include <complex>

#include <cstdio>

#include <cstdlib>

#include <cstring>

#include <ctime>

#include <deque>

#include <exception>

#include <fstream>

#include <functional>

#include <limits>

#include <list>

#include <map>

#include <iomanip>

#include <ios>

#include <iosfwd>

#include <iostream>

#include <istream>

#include <ostream>

#include <queue>

#include <set>

#include <sstream>

#include <stdexcept>

#include <streambuf>

#include <string>

#include <utility>

#include <vector>

#include <cwchar>

#include <cwctype>

#include <stack>

#include <limits.h>

using namespace std;

#define MAXN 100

typedef long long LL;

LL i,M,N,x,t,v,ans,p;

LL dist[MAXN+],vis[MAXN+],level[MAXN+];

vector<pair<LL,LL> > E[MAXN+];

template <typename T> void read(T &x) {

        int f=; char c = getchar(); x=;

        for (; !isdigit(c); c = getchar()) { if (c=='-') f=-; }

        for (; isdigit(c); c = getchar()) x=x*+c-'';

        x*=f;

}

void spfa(int low,int high) {

        int i,to,cost;

        queue<LL> q;

        memset(vis,,sizeof(vis));

        for (i = ; i <= N; i++) dist[i] = 2e9;

        dist[] = ; vis[] = ;

        q.push();

        while (!q.empty()) {

                x = q.front(); q.pop();

                vis[x] = ;

                for (i = ; i < E[x].size(); i++) {

                        to = E[x][i].first;

                        cost = E[x][i].second;

                        if ((level[to] >= low) && (level[to] <= high)) {

                                if (dist[x] + cost < dist[to]) {

                                        dist[to] = dist[x] + cost;

                                        if (!vis[to]) {

                                                vis[to] = ;

                                                q.push(to);

                                        }

                                }

                        }

                }

        }

}

int main() {

        read(M); read(N);

        for (i = ; i <= N; i++) {

                read(p); read(level[i]); read(x);

                E[].push_back(make_pair(i,p));

                while (x--) {

                        read(t); read(v);

                        E[t].push_back(make_pair(i,v));

                }

        }

        ans = 2e9;

        for (i = level[] - M; i <= level[]; i++) {

                spfa(i,i+M);

                ans = min(ans,dist[]);

        }

        cout<< ans << endl;

        return ;

}