int elem = 0;
    int start = -1;
    int td = d;
    int needf = d - q + 1;
    int needo = q - 1;
    int first = 0;
    for (int i = 0; i < m; i++) {
        if (needf != 0 && b[p[elem] - 1] <= t[i]) {
            if (start == -1) {
                start = i;
            }
            ans[i] = p[elem];
            needf--;
        }
        else if (needf == 0 && elem < q - 1 && b[p[elem + 1] - 1] <= t[i]) {
            ans[i] = p[elem + 1];
            elem++;
            needo--;
        }
        else {
            int needf = d - q + 1;
            int needo = q - 1;
            elem = 0;
            start = -1;
            first = 0;
        }
        if (needf == 0 && needo == 0) {
            cout << start + 1 << endl;
            return 0;
        }
    }

    cout << -1 << endl;