using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using static System.Console;
using static System.Math;

namespace AtTest.ABC_174
{
    class F
    {
        static void Main(string[] args)
        {
            var sw = new System.IO.StreamWriter(OpenStandardOutput()) { AutoFlush = false };
            SetOut(sw);

            Method(args);

            Out.Flush();
        }

        static void Method(string[] args)
        {
            int[] nq = ReadInts();
            int n = nq[0];
            int q = nq[1];
            int[] cs = ReadInts();
            int[][] queries = new int[q][];
            for(int i = 0; i < q; i++)
            {
                int[] lr = ReadInts();
                queries[i] = new int[4] { lr[0] - 1, lr[1] - 1, 0, i };
            }

            int[] prevs = new int[n];
            int[] nexts = new int[n];
            for (int i = n - 1; i >= 0; i--)
            {
                if (prevs[cs[i] - 1] > 0)
                {
                    nexts[i] = prevs[cs[i] - 1];
                }
                prevs[cs[i] - 1] = i;
            }

            SegTree<int> tree = new SegTree<int>(n, 0, (a, b) => a + b, 0);
            for (int i = 0; i < n; i++)
            {
                if (prevs[cs[i] - 1] == i)
                {
                    tree.Update(i, 1);
                }
            }

            queries = queries.OrderBy(a => a[0]).ToArray();
            int left = 0;
            for(int i = 0; i < q; i++)
            {
                while (left < queries[i][0])
                {
                    if (nexts[left] > 0)
                    {
                        tree.Update(nexts[left], 1);
                    }
                    left++;
                }

                queries[i][2] = tree.Scan(queries[i][0], queries[i][1] + 1);
            }

            queries = queries.OrderBy(a => a[3]).ToArray();
            for(int i = 0; i < q; i++)
            {
                WriteLine(queries[i][2]);
            }
        }

        class SegTree<T>
        {
            int totalLength;
            T[] tree;
            Func<T, T, T> integrate;
            T exValue;

            public SegTree(int length, Func<T, T, T> integrate, T exValue)
            {
                this.integrate = integrate;
                this.exValue = exValue;
                totalLength = 1;
                while (totalLength < length) totalLength *= 2;

                tree = new T[2 * totalLength - 1];
                for (int i = 0; i < tree.Length; i++) tree[i] = exValue;
            }

            public SegTree(int length, T initialValue,
                Func<T, T, T> integrate, T exValue)
                : this(length, integrate, exValue)
            {
                for (int i = 0; i < length; i++)
                {
                    tree[i + totalLength - 1] = initialValue;
                }
                UpdateAll();
            }

            public void AssignWithoutUpdate(int i, T value)
            {
                tree[i + totalLength - 1] = value;
            }

            public void Update(int i, T value)
            {
                int now = i + totalLength - 1;
                tree[now] = value;
                while (now > 0)
                {
                    now = (now - 1) / 2;
                    tree[now] = integrate(
                        tree[now * 2 + 1], tree[now * 2 + 2]);
                }
            }

            public void UpdateAll()
            {
                for (int i = totalLength - 2; i >= 0; i--)
                {
                    tree[i] = integrate(tree[i * 2 + 1], tree[i * 2 + 2]);
                }
            }

            public T Look(int i) { return tree[i + totalLength - 1]; }

            //[top,last)
            public T Scan(int top, int last)
            {
                return Query(top, last, 0, 0, totalLength);
            }

            T Query(int top, int last, int i, int left, int right)
            {
                if (right <= top || last <= left) return exValue;
                if (top <= left && right <= last) return tree[i];

                T leftValue = Query(top, last, i * 2 + 1,
                    left, (left + right) / 2);
                T rightValue = Query(top, last, (i + 1) * 2,
                    (left + right) / 2, right);

                return integrate(leftValue, rightValue);
            }
        }

        private static string Read() { return ReadLine(); }
        private static char[] ReadChars() { return Array.ConvertAll(Read().Split(), a => a[0]); }
        private static int ReadInt() { return int.Parse(Read()); }
        private static long ReadLong() { return long.Parse(Read()); }
        private static double ReadDouble() { return double.Parse(Read()); }
        private static int[] ReadInts() { return Array.ConvertAll(Read().Split(), int.Parse); }
        private static long[] ReadLongs() { return Array.ConvertAll(Read().Split(), long.Parse); }
        private static double[] ReadDoubles() { return Array.ConvertAll(Read().Split(), double.Parse); }
    }
}


Measured memory_bytes: 110152