#include <fstream>
#include <algorithm>
#define Xp 666013
using namespace std;
class InputReader {
    public:
        InputReader() {}
        InputReader(const char *file_name) {
            input_file = fopen(file_name, "r");
            cursor = 0;
            fread(buffer, SIZE, 1, input_file);
        }
        inline InputReader &operator >>(int &n) {
            while(buffer[cursor] < '0' || buffer[cursor] > '9') {
                advance();
            }
            n = 0;
            while('0' <= buffer[cursor] && buffer[cursor] <= '9') {
                n = n * 10 + buffer[cursor] - '0';
                advance();
            }
            return *this;
        }
    private:
        FILE *input_file;
        static const int SIZE = 1 << 17;
        int cursor;
        char buffer[SIZE];
        inline void advance() {
            ++ cursor;
            if(cursor == SIZE) {
                cursor = 0;
                fread(buffer, SIZE, 1, input_file);
            }
        }
}f("distincte.in");
ofstream g("distincte.out");
struct punct
{
    int a;
    int b;
    int poz;
}t[1<<17];
int n,m,k,i,j,v[1<<17],is_Aib[1<<17],Sol[1<<17];
long long Aib[1<<17];
bool cmp(punct x,punct y)
{
    return x.b<y.b;
}
int next(int x)
{
    return x&(-x);
}
void update(int poz,int val)
{
    while(poz<=n)
    {
        Aib[poz]+=val;
        poz+=next(poz);
    }
}
long long query(int poz)
{
    long long r=0;
    while(poz)
    {
        r+=Aib[poz];
        poz-=next(poz);
    }
    return r;
}
int main()
{
    f>>n>>k>>m;
    for(i=1;i<=n;++i) f>>v[i];
    for(i=1;i<=m;++i)
    {
        f>>t[i].a>>t[i].b;
        t[i].poz=i;
    }
    sort(t+1,t+m+1,cmp);
    for(i=1;i<=m;++i)
    {
        for(j=t[i-1].b+1;j<=t[i].b;++j)
        {
            if(is_Aib[v[j]]) update(is_Aib[v[j]],-v[j]);
            update(j,v[j]);
            is_Aib[v[j]]=j;
        }
        Sol[t[i].poz]=(query(t[i].b)-query(t[i].a-1))%Xp;
    }
    for(i=1;i<=m;++i) g<<Sol[i]<<'\n';
    return 0;
}