#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<cstring>
using namespace std;
#define INF 0x3f3f3f3f
int M, N; //最大等级差距与物品数
const int MAX_N = 110;
struct Edge{int to;int cost;Edge(int tt, int cc) : to(tt), cost(cc) {}
};
vector<Edge> G[MAX_N];void addEdge (const int& u, const int& v, const int& w) {G[u].push_back(Edge(v, w));
}struct Node{int id;int cost;friend bool operator < (const Node& a, const Node& b) {return a.cost > b.cost;}
}dis[MAX_N];
bool visit[MAX_N];
int level[MAX_N];
bool outlevel[MAX_N];
void dijkstra(const int& s) {for (int i = 0; i <= N; i++) dis[i].id = i, dis[i].cost = INF;dis[0].id = 0, dis[0].cost = 0; for (int i = 0; i <= N; i++) visit[i] = false;priority_queue<Node> pQueue;pQueue.push(dis[0]);while(!pQueue.empty()) {int u = pQueue.top().id; pQueue.pop();if (visit[u]) continue;visit[u] = true;for (int j = 0; j < G[u].size(); j++) {int v = G[u][j].to;int cost = G[u][j].cost;if (!outlevel[v] && dis[v].cost > dis[u].cost + cost ) {dis[v].cost =  dis[u].cost + cost;pQueue.push(dis[v]);}}}
}int main(void) {cin >> M >> N;for (int i = 0; i <= N; i++) G[i].clear();for (int i = 1; i <= N; i++) {int P, L, X;cin >> P >> L >> X;level[i] = L;addEdge(0, i, P); //探险家可直接买物品//以物抵金币for (int j = 1; j <= X; j++) {int num, cost;cin >> num >> cost;addEdge (num, i, cost);}}//枚举每一个等级作为最小等级，在可交换的等级区间内求最短路   int ans = INF;for (int i = 1; i <= N; i++) {//去除不可交换的等级区间内的物品for (int j = 1; j <= N; ++j) outlevel[j] = false;int min_level = level[i]; for (int j = 1; j <= N; j++) {if (level[j] < min_level || min_level + M < level[j] ) outlevel[j] = true; //第j个物品不可用于交换
        }dijkstra(0);ans = min(ans, dis[1].cost); }cout << ans << endl;return 0;
}