//
// Created by 조문성 on 2024. 10. 13..
//
#include <bits/stdc++.h>
#define int long long
#define all(v) v.begin(), v.end()
#define prs(v) sort(all(v)); v.erase(unique(all(v)), v.end())
using namespace std;
// using ll = long long;
const int tN = 1 << 20;
int t1[tN + 1], t2[tN + 1];

void update(int i, int k, int op) {
    for (; i < tN; i += i & -i)(op ? t1 : t2)[i] += k;
}

int query(int i, int op) {
    int res = 0;
    for (; i; i -= i & -i)res += (op ? t1 : t2)[i];
    return res;
}

int qry(int l, int r, int op) {
    return query(r, op) - query(l - 1, op);
}

signed main() {
    cin.tie(0)->sync_with_stdio(0);
    int n, k, m, Q;
    cin >> n >> k >> m >> Q;
    vector<int> W1(n + 1), W2(m + 2);
    vector<int> on1(n + 1, 1), on2(m + 2, 1);
    for (int s = 1; s <= n; s++)cin >> W1[s];
    for (int s = 1; s <= m + 1; s++)cin >> W2[s];
    for (int s = 1; s <= n; s++)update(s, W1[s], 1);
    for (int s = 1; s <= m + 1; s++)update(s, W2[s], 0);
    auto dist = [&](int u, int v) {
        if (u > v)swap(u, v);
        int l = qry(u, v - 1, 1);
        int r = qry(1, u - 1, 1) + qry(v, n, 1);
        return min(l, r);
    };
    for (int q = 1; q <= Q; q++) {
        char op;
        cin >> op;
        if (op == 'q') {
            int u, v;
            cin >> u >> v;
            if (u > v)swap(u, v);
            int l = dist(u, v);
            int a = dist(u, 1) + dist(k, v) + qry(1, m + 1, 0);
            int b = dist(u, k) + dist(1, v) + qry(1, m + 1, 0);
            int mn = min({l, a, b});
            if (mn > 1e9)cout << "impossible\n";
            else cout << mn << '\n';
        } else if (op == 'c') {
            int i;
            cin >> i;
            if (on1[i])update(i, -W1[i], 1), update(i, 1e11, 1), on1[i] = 0;
            else update(i, -1e11, 1), update(i, W1[i], -1), on1[i] = 1;
        } else {
            int i;
            cin >> i;
            i++;
            if (on2[i])update(i, -W2[i], 0), update(i, 1e11, 0), on2[i] = 0;
            else update(i, -1e11, 0), update(i, W2[i], 0), on2[i] = 1;
        }
    }
}