#include<bits/stdc++.h>
using namespace std;
int n;
struct mt {
    int p[100005] , B;
    priority_queue<int , vector<int> , greater<int> > pq[320] , dec[320];
    void init() {
        B = sqrt(n);
        for(int i = 1;i <= n;i++) {
            for(int j = i + 1 ; j <= i + B && j <= n;j++) {
                if(1LL * (j - i) * abs(p[i] - p[j]) >= n) continue ;
                pq[j - i].push(abs(p[i] - p[j]));
            }
        }
    }
    int calc() {
        int ans = 1e9;
        for(int i = 1;i <= B;i++) {
            while(pq[i].size() && dec[i].size() && pq[i].top() == dec[i].top()) {
                pq[i].pop() ; dec[i].pop() ;
            }
            if(!pq[i].size()) continue ;
            int mn = pq[i].top() ;
            if(1LL * i* mn < ans) ans = i * mn;
        }
        return ans;
    }
    void swp(int a,int b) {
        if(a > b) swap(a,b) ;
        for(int i = max(1 , a - B) ; i <= a + B && i <= n;i++) {
            if(i == a) continue ;
            if(1LL * abs(p[i] - p[a]) * abs(i - a) >= n) continue ;
            dec[abs(i - a)].push(abs(p[i] - p[a]));
        }
        for(int i = max(1 , b - B) ; i <= b + B && i <= n;i++) {
            if(i == b) continue ;
            if(i == a) continue ;
            if(1LL * abs(p[i] - p[b]) * abs(i - b) >= n) continue ;
            dec [abs(i - b)].push(abs(p[i] - p[b])) ;
        }

        swap(p[a] , p[b]) ;
        for(int i = max(1 , a - B) ; i <= a + B && i <= n;i++) {
            if(i == a) continue ;
            if(1LL * abs(p[i] - p[a]) * abs(i - a) >= n) continue ;
            pq[abs(i - a)].push(abs(p[i] - p[a]));
        }
        for(int i = max(1 , b - B) ; i <= b + B && i <= n;i++) {
            if(i == b) continue ;
            if(i == a) continue ;
            if(1LL * abs(p[i] - p[b]) * abs(i - b) >= n) continue ;
            pq [abs(i - b)].push(abs(p[i] - p[b])) ;
        }
        return ;
    }
}p , r;
int q;
int val[100005];
void solv() {
    cin >> n >> q;
    for(int i = 1;i <= n;i++) {
        cin >> p.p[i];
        val[i] = p.p[i];
        r.p[p.p[i]] = i;
    }
    p.init() ; r.init() ;
    cout << min(p.calc() , r.calc()) << '\n' ;
    for(int i = 1;i <= q;i++) {
        int a , b;
        cin >> a >> b;
        p.swp(a,b) ;
        r.swp(val[a] ,val[b]);
        swap(val[a] , val[b]) ;
        cout << min(p.calc() , r.calc()) << '\n' ;
    }
    return ;
}
int main() {
    ios::sync_with_stdio(false) ; cin.tie(0) ;
    int t = 1;
    while(t--) solv() ;
}