#include<bits/stdc++.h>
int main()
{
	int total,times;
	std::cin>>total>>times;
	int numbers[total];
	for(int y=0;y<total;y+=1){std::cin>>numbers[y];}
	for(int t=0;t<times;t+=1)
	{
		int L,R;
		std::cin>>L>>R;
		int res=INT_MAX;
		if(L!=R)
		{
			for(int y=L-1;y<R;y+=1)
			{
				for(int x=y+1;x<R;x+=1)
				{
					int tr=x-y+1;
					int ok=0;
					int check[x-y+1];
					for(int aa=y;aa<x+1;aa+=1){check[aa-y]=numbers[aa];}
					int no=0;
					for(int find=L-1;find<R;find+=1)//判断[l,R]内的元素是否都在[x,y]内出现过
					{
						ok=0;
						for(int ch=0;ch<x-y+1;ch+=1)
						{
							if(check[ch]==numbers[find])
							{
								ok=1;
								break;
							}
						}
						if(ok==0)
						{
							no=1;
							break;
						}
					}
					if(tr<res and no==0/*确保[l,R]内的元素是否都在[x,y]内出现过*/){res=tr;}
				}
			}
			std::cout<<res<<"\n";
	    }
	    else{std::cout<<"1\n";}
	}
}