OIG X - arytmetyczny

// https://szkopul.edu.pl/problemset/problem/GE48t27fgAbn4WNGoGhVChb-/site/?key=statement

#include <bits/stdc++.h>

int main() {
    std::ios_base::sync_with_stdio(0);
    std::cin.tie(0);
    std::cout.tie(0);

    int n, q;
    std::cin >> n >> q;

    std::vector<int> v(n);
    for (auto& a : v) {
        std::cin >> a;
    }

    std::vector<int> pref(n), r(n);
    for (int i = 1; i < n; i++) {
        r[i] = v[i] - v[i - 1];
        pref[i] += pref[i - 1] + r[i];
    }

    std::vector<int> sd(n);

    for (int i = 1; i < n; i++) {
        if (r[i] == r[i - 1]) {
            sd[i] = sd[i - 1] + 1;
        } else {
            sd[i] = 1;
        }
    }

    for (; q > 0; q--) {
        int x, y;
        std::cin >> x >> y;

        y--;

        if (sd[y] >= y - x + 1) {
            std::cout << "TAK\n";
        } else {
            std::cout << "NIE\n";
        }
    }

    return 0;
}