#include <bits/stdc++.h>
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
const ll ILL=2167167167167167167;
const int INF=2100000000;
const int mod=998244353;
#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,T b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,T b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
bool yneos(bool a,bool upp=0){if(a){cout<<(upp?"YES\n":"Yes\n");}else{cout<<(upp?"NO\n":"No\n");}return a;}
template<class T> void vec_out(vector<T> &p,int ty=0){
if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<",";}cout<<'"'<<p[i]<<'"';}cout<<"}\n";}
else{if(ty==1){cout<<p.size()<<"\n";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}}
template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}
template<class T> T vec_sum(vector<T> &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;}
int pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}
template<class T> bool inside(T l,T x,T r){return l<=x&&x<r;}

template <typename G>
struct HeavyLightDecomposition {
	void dfs_sz(int cur) {
		size[cur] = 1;
		for(auto& dst : g[cur]) {
			if(dst == par[cur]) {
				if((int)g[cur].size() >= 2 && dst == g[cur][0]) swap(g[cur][0], g[cur][1]);
				else continue;
			}
			depth[dst] = depth[cur] + 1;
			par[dst] = cur;
			dfs_sz(dst);
			size[cur] += size[dst];
			if(size[dst] > size[g[cur][0]]) swap(dst, g[cur][0]);
		}
	}
	void dfs_hld(int cur) {
		down[cur] = id++;
		for(auto dst : g[cur]) if(dst != par[cur]) {
			nxt[dst] = dst == g[cur][0] ? nxt[cur] : dst;
			dfs_hld(dst);
		}
		up[cur] = id;
	}
	// [u, v)
	vector<pair<int, int>> ascend(int u, int v) const {
		vector<pair<int, int>> res;
		while(nxt[u] != nxt[v]) {
			res.emplace_back(down[u], down[nxt[u]]);
			u = par[nxt[u]];
		}
		if(u != v) res.emplace_back(down[u], down[v] + 1);
		return res;
	}
	// (u, v]
	vector<pair<int, int>> descend(int u, int v) const {
		if(u == v) return {};
		if(nxt[u] == nxt[v]) return {{down[u] + 1, down[v]}};
		auto res = descend(u, par[nxt[v]]);
		res.emplace_back(down[nxt[v]], down[v]);
		return res;
	}
	G& g;
	int n, id;
	vector<int> size, depth, down, up, nxt, par;
	HeavyLightDecomposition(G& _g, int root = 0) : g(_g), n(g.size()), id(0), size(n), depth(n), down(n, -1), up(n, -1), nxt(n, root), par(n, root) {
		dfs_sz(root);
		dfs_hld(root);
	}
	pair<int, int> idx(int i) const { return {down[i], up[i]}; }
	template <typename F>
	void path_query(int u, int v, bool vertex, const F& f) {
		int l = lca(u, v);
		for(auto& [a, b] : ascend(u, l)) {
			int s = a + 1, t = b;
			s > t ? f(t, s) : f(s, t);
		}
		if(vertex) f(down[l], down[l] + 1);
		for(auto& [a, b] : descend(l, v)) {
			int s = a, t = b + 1;
			s > t ? f(t, s) : f(s, t);
		}
	}
	template <typename F>
	void path_query_easy (int u, int v, bool vertex, const F& f) {
		int l = lca(u, v);
		for(auto& [a, b] : ascend(u, l)) f(a + 1, b);
		if(vertex) f(down[l], down[l] + 1);
		for(auto& [a, b] : descend(l, v)) f(a, b + 1);
	}
	template <typename F> void subtree_query(int u, bool vertex, const F& f) {
		f(down[u] + !vertex, up[u]);
	}
	int lca(int a, int b) {
		while(nxt[a] != nxt[b]) {
			if(down[a] < down[b]) swap(a, b);
			a = par[nxt[a]];
		}
		return depth[a] < depth[b] ? a : b;
	}
	int dist(int a, int b) { return depth[a] + depth[b] - depth[lca(a, b)] * 2; }
};

#include <atcoder/segtree>
using F = pair<ll, ll>;
F op_max(F a, F b){
    return max(a, b);
}
F e_max(){
    return {-1, -1};
}

#include <atcoder/lazysegtree>

using lazy_S = ll;

using lazy_F = ll;

lazy_S lazy_op(lazy_S l, lazy_S r) {
    return min(l, r);
}

lazy_S lazy_e() { return ILL; }

lazy_S mapping(lazy_F l, lazy_S r) {
    return l + r;
}

//l(r(x))
lazy_F composition(lazy_F l, lazy_F r) {
    return l + r;
}

lazy_F lazy_id(){return 0;}

#define lazy_calc lazy_S,lazy_op,lazy_e,lazy_F,mapping,composition,lazy_id


ll target;
bool g(ll x){
    return x > target;
}
void solve();
// CYAN / FREDERIC
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    
    int t = 1;
    // cin >> t;
    rep(i, 0, t) solve();
}

void solve(){
    ll N, Q, L;
    cin >> N >> Q >> L;
    vector<ll> A(N), X(N);
    rep(i, 0, N) cin >> A[i];
    rep(i, 0, N) cin >> X[i];
    vector<vector<int>> G(N);
    atcoder::segtree<F, op_max, e_max> seg(N);
    vector<ll> S(N), pare(N, -1);
    vector<int> C;
    C.reserve(N);
    rep(i, 0, N){
    	int prv = -1;
    	while (!C.empty()){
    		if (A[C.back()] < A[i]){
    			prv = C.back();
    			C.pop_back();
    		}
    		else break;
    	}
    	if (prv != -1) pare[prv] = i;
    	if (!C.empty()) pare[i] = C.back();
    	C.push_back(i);
    }
    int root = -1;
    rep(i, 0, N){
    	if (pare[i] != -1) G[pare[i]].push_back(i);
    	else root = i;
    }
    auto dfs = [&](auto self, int a) -> ll {
    	S[a] += X[a];
    	for (auto x : G[a]) S[a] += self(self, x);
    	return S[a];
    };dfs(dfs, root);
    atcoder::lazy_segtree<lazy_calc> path(N);
    HeavyLightDecomposition H(G, root);
    vector<int> inv(N);
    rep(i, 0, N) inv[H.down[i]] = i;
    vector<ll> B(N, ILL);
    rep(i, 0, N) if (i != root) B[i] = A[pare[i]];
    rep(i, 0, N){
        path.set(H.down[i], S[i] - B[i]);
    }
    while (Q--){
        int t;
        cin >> t;
        if (t == 1){
            ll a, b;
            cin >> a >> b;
            a--;
            auto add = [&](int l, int r) -> void {
                path.apply(l, r, b - X[a]);
            };
            H.path_query_easy(root, a, 1, add);
            X[a] = b;
        }
        if (t == 2){
            ll c;
            cin >> c;
            ll ind = c;
            if (A[ind] > A[ind - 1]) ind = c - 1;
            if (A[ind] > L){
                cout << L << "\n";
                continue;
            }
            int ans = -1;
            target = -L;
            auto que = [&](int l, int r) -> void {
            	if (ans != -1 || g(path.prod(l, r))) return;
                int b = path.min_left<g>(r);
                ans = b - 1;
            };
            H.path_query(ind, root, 1, que);
            cout << L + B[inv[ans]] + path.get(ans) << "\n";
        }
    }
}