15分，求救

#include<bits/stdc++.h>
using namespace std;

int main() {
    int n, m, k;
    cin >> n >> m >> k;
    int ks = -k;
    queue<int> q;
    int b;
    for (int i = 1; i <= n; i++) {
        cin >> b;
        q.push(b);
    }

    int x;
    for (int i = 1; i <= m; i++) {
        cin >> x;
        if (x == 1) {
            cin >> b;
            int size = q.size();
            for (int j = 0; j < size; j++) {
                int pos = q.front();
                q.pop();
                if (pos + b <= k) {
                    q.push(pos + b);
                }
            }
        } else if (x == 2) {
            cin >> b;
            int size = q.size();
            for (int j = 0; j < size; j++) {
                int pos = q.front();
                q.pop();
                if (pos - b >= ks) {
                    q.push(pos - b);
                }
            }
        } else if (x == 3) {
            cout << q.size() << endl;
        }
    }
    return 0;
}