uva11235

//先用游尺编码，接着用ST算法（或者线段树）

#include <iostream>
#include<string.h>
#include<stdio.h>
#include<cmath>
using namespace std;
const int maxn=100005;
//int value[maxn];
int left1[maxn];
int right1[maxn];
int count1[maxn];
int shu[maxn];
int num[maxn];
int dp[maxn][20];//表示从I处开始算2的J处结束
void st(int k)
{
    int i,j;
    for(i=1;i<=k;i++)
      dp[i][0]=count1[i];
    for(j=1;(1<<j)<=k;j++)
    {
        for(i=1;i+(1<<j)<=k;i++)
            dp[i][j]=max(dp[i][j-1],dp[i+(1<<(j-1))][j-1]);
    }
}
int rmq(int l,int r)
{
    int k=0;
    while(1<<(k+1)<=r-l+1)//这个地方写错了，卡了我半天，%>_<%
    {
        k++;
    }
    //cout<<dp[l][k]<<" "<<dp[r-(1<<k)+1][k]<<endl;
    return  max(dp[l][k],dp[r-(1<<k)+1][k]);
}
int main()
{
    int n,q;
    while(scanf("%d",&n)!=EOF,n)
    {
        scanf("%d",&q);
        int i,k=1;
        for(i=1;i<=n;i++)
        {
            scanf("%d",&shu[i]);
        }
        for(i=1;i<=n;i++)
        {
            //value[k]=shu[i];
            left1[k]=i;
            num[i]=k;
            int cou_num=1;
            while(shu[i]==shu[i+1])
            {
                cou_num++;
                i++;
                num[i]=k;
            }
            right1[k]=i;
            count1[k]=cou_num;
            k++;
        }
        //for(i=1;i<=k-1;i++)
           // cout<<count1[i]<<" ";
        //cout<<endl;
        st(k-1);
        for(i=1;i<=q;i++)
        {
            int a,b;
            scanf("%d%d",&a,&b);
            int k1=num[a];
            int k2=num[b];
            int ans;
            if(k1==k2)
                cout<<b-a+1<<endl;
            if(k2-k1==1)
            {
               ans=max(right1[k1]-a+1,b-left1[k2]+1);
               cout<<ans<<endl;
            }
            if(k2-k1>1)
            {
                ans=max(right1[k1]-a+1,b-left1[k2]+1);
                //cout<<ans<<endl;
                //cout<<k2<<" "<<k1<<endl;
                ans=max(ans,rmq(k1+1,k2-1));
                cout<<ans<<endl;
            }

        }
    }
}