#include <bits/stdc++.h>
using namespace std;
#define int long long
constexpr int inf = 1e18;
signed main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, m;
cin >> n >> m;
vector<int> b(m), p(m);
for (int i = 0; i < m; i++) {
cin >> b[i] >> p[i];
}
vector<set<int>> t(n);
vector<vector<pair<int, int>>> g(n);
for (int i = 0; i < m; i++) {
t[b[i]].insert(p[i]);
}
for (int i = 0; i < n; i++) {
for (auto p : t[i]) {
for (int j = 1; i + j * p < n; j++) {
int pos = i + j * p;
g[i].push_back({pos, j});
if (t[pos].count(j)) {
break;
}
}
for (int j = 1; i - j * p >= 0; j++) {
int pos = i - j * p;
g[i].push_back({pos, j});
if (t[pos].count(j)) {
break;
}
}
}
}
vector<int> d(n, inf);
priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> q;
q.push({0, b[0]});
while (!q.empty()) {
auto [dist, u] = q.top();
q.pop();
if (d[u] < dist) continue;
d[u] = dist;
for (auto [v, w] : g[u]) {
if (dist + w < d[v]) {
d[v] = dist + w;
q.push({d[v], v});
}
}
}
cout << (d[b[1]] == inf ? -1 : d[b[1]]) << '\n';
return 0;
}
