#include<bits/stdc++.h>
//#include <ext/pb_ds/hash_policy.hpp>
//#include <ext/pb_ds/assoc_container.hpp>
namespace infinities{
    #define fint register int
    #define ls(i) (i << 1)
    #define rs(i) ((i << 1) | 1)
    #define pii pair<int, int>
    #define im int mid = (l + r) >> 1
    #define INT __int128
    #define ll long long
    #define ui unsigned int
    #define lc ch[now][0]
    #define rc ch[now][1]
    const int mod = 998244353, INF = 998244353, maxn = (1 << 20) - 1;
    namespace FastIO{//10M
        const int SS = 1e7; char num_[50]; int cnt_;
        inline int xchar(){static char buf[SS]; static int len = 0, pos = 0; if(pos == len)pos = 0, len = fread(buf, 1, SS, stdin); if(pos == len)exit(0); return buf[pos++];}
        inline int read(){fint x = 0, f = 1, ch = getchar(); while(ch < '0' || ch > '9'){if(ch == '-')f = -1; ch = getchar();}while(ch >= '0' && ch <= '9'){x = (x << 1) + (x << 3) + (ch ^ 48); ch = getchar();} return x * f;}
        inline void write(int x){if(x == 0){putchar('0'); return;}if(x < 0)putchar('-'), x = -x; while(x)num_[++cnt_] = x % 10 ^ 48,x /= 10; while(cnt_)putchar(num_[cnt_--]);}
        inline void write(int x, char c){write(x), putchar(c);}
    }
    using namespace std;
    using namespace FastIO;
    namespace mystd{
        inline int qmin(int a, int b){return (a > b) ? b : a;} inline int qmax(int a, int b){return (a > b) ? a : b;}
        inline void chkmin(int &a, int b){a = min(a, b); return;} inline void chkmax(int &a, int b){a = max(a, b); return;}
        inline void qk(int &a, int b){a = a + b; a = (a >= mod) ? a - mod : a;}
        inline void sub(int &a, int b){a = a - b + mod; a = (a >= mod) ? a - mod : a;}
		inline int mul(int a, int b){return (1ll * a * b % mod + mod) % mod;}
        inline int qpow(int x, int k){fint res = 1; for(; k; k = (k >> 1), x = 1ll * x * x % mod)if(k & 1)res = 1ll * res * x % mod; return res;}
        inline void looked(int a[], int n){for(fint i = 1; i < n; i++)write(a[i], ' '); write(a[n], '\n');} inline void debug(){puts("qwq");} inline void YES(){puts("YES");} inline void Yes(){puts("Yes");} inline void yes(){puts("yes");} inline void NO(){puts("NO");} inline void No(){puts("No");} inline void no(){puts("no");}
    }
	using namespace mystd;
	//using namespace __gnu_pbds;
	//gp_hash_table<int, int>hsh;
    void file(){freopen("a.in", "r", stdin), freopen("a.out", "w", stdout);}
    int n, q, a[maxn], las[maxn], p[maxn], jump[20][maxn];
    signed main(){
    	n = read(), q = read();
    	p[0] = n + 1;
    	for(fint i = 1; i <= n; i++)a[i] = read(), p[i] = n + 1;
    	for(fint i = 1; i <= n; i++){
			if(las[a[i]] > 0)chkmin(p[las[a[i]] - 1], i);
			las[a[i]] = i;
		}
		for(fint i = n - 1; i >= 0; i--)chkmin(p[i], p[i + 1]);
		p[n + 1] = n + 1;
		for(fint i = 0; i <= n + 1; i++)jump[0][i] = p[i];
		for(fint i = 1; i < 20; i++)for(fint j = 0; j <= n + 1; j++)jump[i][j] = jump[i - 1][jump[i - 1][j]];
		while(q--){
			fint u = read(), v = read();
			if(u > v)swap(u, v);
			fint ans = (v - u) * 2;
			--u;
			for(fint i = 19; i >= 0; i--)if(jump[i][u] <= v)u = jump[i][u], ans -= (1 << i);
			cout << ans << "\n";
		}
        return 0;
    }
}
signed main(){
    return infinities::main();
}