#include <iostream>
#include <cstring>
#include <algorithm>

using namespace std;

const int N = 2e3 + 10;

int n, q;
int a[N], b[N];

int main()
{
	scanf("%d%d", &n ,&q);
	for (int i = 1; i <= n; i ++ )
	{
		scanf("%d", &a[i]);
	}
	while (q -- )
	{
		memset(b, 0, sizeof b);
		int l, r;
		scanf("%d%d", &l, &r);
		int l1 = l, l2 = l, r1 = r, r2 = r;
		for (int i = l; i <= r; i ++ )
		{
			b[a[i]] ++ ;
		}
		while (b[a[l1]] > 1)
		{
			b[a[l1]] -- ;
			l1 ++ ;
		}
		while (b[a[r1]] > 1)
		{
			b[a[r1]] -- ;
			r1 -- ;
		}
		while (b[a[r2]] > 1)
		{
			b[a[r2]] -- ;
			r2 -- ;
		}
		while (b[a[l2]] > 1)
		{
			b[a[l2]] -- ;
			l2 ++ ;
		}
		printf("%d\n", min(r1 - l1 + 1, r2 - l2 + 1));
	}
	return 0;
}