#include <bits/stdc++.h>
using namespace std;
ifstream f("distincte.in");
ofstream g("distincte.out");
const int nmax = 100001, mod = 666013;
typedef long long ll;
int n, m, v[nmax], bif[nmax];
ll aib[nmax], af[nmax];
void add(int x, int poz)
{
    while (poz <= n)
        aib[poz] += x, poz += poz & -poz;
}
ll sum(int poz)
{
    ll r = 0;
    while (poz > 0)
        r += aib[poz], poz -= poz & -poz;
    return r;
}
struct query
{
    int st, dr, p;
} q[nmax];
int main()
{
    f >> n >> m >> m;
    for (int i = 1; i <= n; i++)
        f >> v[i];
    for (int i = 1; i <= m; i++)
        f >> q[i].st >> q[i].dr, q[i].p = i;
    sort(q + 1, q + m + 1, [](const query &a, const query &b) {
        return a.dr < b.dr;
    });
    for (int i = 1, j = 1; i <= n && j <= m; i++)
    {
        if (bif[v[i]])
            add(-v[i], bif[v[i]]);
        add(v[i], i);
        bif[v[i]] = i;
        while (j <= m && q[j].dr == i)
        {
            af[q[j].p] = sum(q[j].dr) - sum(q[j].st - 1);
            j++;
        }
    }
    for (int i = 1; i <= m; i++)
        g << af[i] % mod << '\n';
    return 0;
}