#include<bits/stdc++.h>
#define int long long
#define IOS ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define awa return 0;
using namespace std;
const int maxn=2e3+10;
void findx(int l,int r,const vector<int>& a)
{
    set<int> m;
    for(int i=l;i<=r;i++)
    {
        m.insert(a[i]);
    }
    int min_len=r-l+1;
    map<int,int> window;
    int left=l;
    for(int right=l;right<=r;right++)
    {
        window[a[right]]++;
        while(window.size()==m.size())
        {
            min_len=min(min_len,right-left+1);
            window[a[left]]--;
            if (window[a[left]]==0)
            {
                window.erase(a[left]);
            }
            left++;
        }
    }
    cout<<min_len<<endl;
}
signed main()
{
    IOS;
    int n,q;
    cin>>n>>q;
    vector<int>a(n);
    for (int i=0;i<n;++i)
    {
        cin>>a[i];
    }
    for (int i=0;i<q;i++)
    {
        int l,r;
        cin>>l>>r;
        findx(l-1,r-1,a); 
    }
    awa
}
//