#include <bits/stdc++.h>
using namespace std;
#define int long long
#define inf 0x3F3F3F3F3F3F3F3F
const int MXN = 3e4 + 5;
int b[MXN], p[MXN], dist[MXN];
vector<int> adj[MXN];
map<int, int> mp[MXN];
signed main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, m;
cin >> n >> m;
for (int i = 0; i < n; i++) dist[i] = inf;
for (int i = 0; i < m; i++)
{
cin >> b[i] >> p[i];
if (p[i] > n) continue;
adj[b[i]].push_back(p[i]);
}
for (int i = 0; i < n; i++) sort(adj[i].begin(), adj[i].end()), adj[i].resize(unique(adj[i].begin(), adj[i].end()) - adj[i].begin());
priority_queue<array<int, 2>, vector<array<int, 2>>, greater<array<int, 2>>> pq;
dist[b[0]] = 0;
pq.push({0, b[0]});
while (!pq.empty())
{
array<int, 2> f = pq.top();
pq.pop();
if (f[0] > dist[f[1]]) continue;
for (int v : adj[f[1]])
{
for (int i = f[1] - v; i >= 0; i -= v)
{
if (dist[i] > dist[f[1]] + ((f[1] - i) / v))
{
dist[i] = dist[f[1]] + ((f[1] - i) / v);
if (!adj[i].empty())
pq.push({dist[i], i});
}
if (binary_search(adj[i].begin(), adj[i].end(), v)) break;
}
for (int i = f[1] + v; i < n; i += v)
{
if (dist[i] > dist[f[1]] + ((i - f[1]) / v))
{
dist[i] = dist[f[1]] + ((i - f[1]) / v);
if (!adj[i].empty())
pq.push({dist[i], i});
}
if (binary_search(adj[i].begin(), adj[i].end(), v)) break;
}
}
}
cout << (dist[b[1]] >= inf ? -1 : dist[b[1]]) << '\n';
}
