#include <bits/stdc++.h>
using namespace std;
int a[100001];
const int MAGIC = 320;
struct BLACK_MAGIC {
    int left, right, id;
};
bool comp(BLACK_MAGIC a, BLACK_MAGIC b) {
    if (a.left / MAGIC != b.left / MAGIC) {
        return a.left / MAGIC < b.left / MAGIC;
    } return a.right / MAGIC < b.right / MAGIC;
}

void rem(int x) {
}
void add(int x) {

}
int main(){
    int n, m, k;
    cin >> n >> m >> k;
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
    }
    for (int i = 1; i <= m; i++) {
        cin >> q[i].left >> q[i].right;
        q[i].id = i;
    }
    sort(q + 1, q + 1 + m, comp);
    for (int i = 1; i <= m; i++) {
        int L, R;
        L = R = 1;
        int l = q[i].left, r = q[i].right;
        while(L < l) add(L++);
        while(L > l) rem(--L);
        while(R < r) add(++R);
        while(R > r) rem(R--);
    }
}