#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>
#include <atcoder/math>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;

template<typename T>
vector<vector<T>> vec2d(int n, int m, T v){
    return vector<vector<T>>(n, vector<T>(m, v));
}

template<typename T>
vector<vector<vector<T>>> vec3d(int n, int m, int k, T v){
    return vector<vector<vector<T>>>(n, vector<vector<T>>(m, vector<T>(k, v)));
}

template<typename T>
void print_vector(vector<T> v, char delimiter=' '){
    if(v.empty()) {
        cout << endl;
        return;
    }
    for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter;
    cout << v.back() << endl;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    int n, m; cin >> n >> m;
    vector<int> b(m), c(m);
    for(int i = 0; i < m; i++) {
        cin >> b[i] >> c[i];
        c[i] %= b[i];
        c[i] += b[i];
        c[i] %= b[i];
    }
    ll ans = c[0];
    ll l = b[0];
    for(int i = 1; i < m; i++){
        if(l > n){
            if(ans%b[i] == c[i]) continue;
            cout << "NaN" << endl;
            return 0;
        }
        auto [rem, lc] = atcoder::crt({ans, c[i]}, {l, b[i]});
        if(lc == 0){
            cout << "NaN" << endl;
            return 0;
        }
        if(ans > n){
            cout << "NaN" << endl;
            return 0;
        }
        ans = rem;
        l = lc;
    }
    if(ans <= n) cout << ans << endl;
    else cout << "NaN" << endl;
}