#include<bits/stdc++.h>
using namespace std;
#define A(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define UNI(x) sort(A(x)); (x).erase(unique(A(x)),(x).end())
#define int int64_t
void _read();

const int INF = 3e17 + 9847;
main () { _read(); 

      int n,m;
      cin >> n >> m;
      int src,des;
      cin >> src >> des;
      vector<vector<tuple<int,int,int>>> adj(n + 1);
      while(m--) {
            int a,b,T,K;
            cin >> a >> b >> T >> K;
            adj[a].emplace_back(b,T,K);
            adj[b].emplace_back(a,T,K);
      }
      // The parameter really is just the extra time.
      //? Say you are now at time t, to get to the next edge to must add and extra time oh Yeah that fixes stuff.
      //! Simple DIJKSTRA. --_(^_^)_--
      vector<int> dis(n + 1,INF);
      // Because distance is time!! 
      dis[src] = 0;
      set<pair<int,int>> sp;
      sp.emplace(0,src);
      while(!sp.empty()) {
            auto [d,u] = * sp.begin();
            sp.erase(sp.begin());
            for(auto &[v,t,k] : adj[u]) {
                  int d_now = ((d + k - 1) / k) * k + t;
                  if(dis[v] > d_now) {
                        if(dis[v] != INF) {
                              sp.erase(sp.find({dis[v],v}));
                        }
                        dis[v] = d_now;
                        sp.emplace(d_now,v);
                  }
            }
      }
      cout << (dis[des] == INF ? -1 : dis[des]) << '\n';
      return 0;
};

void _read() {
      ios_base :: sync_with_stdio(false);
      cin.tie(NULL);
      #ifdef LOCAL
      freopen("input.txt","r",stdin);
      #endif
}

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef pair<ll, ll> p_ll;

template<class T>
void debug(T itr1, T itr2) { auto now = itr1; while(now<itr2) { cout << *now << " "; now++; } cout << endl; }
#define repr(i,from,to) for (ll i=(ll)from; i<(ll)to; i++)
#define all(vec) vec.begin(), vec.end()
#define rep(i,N) repr(i,0,N)
#define per(i,N) for (ll i=(ll)N-1; i>=0; i--)

const ll MOD = pow(10,9)+7;
const ll LLINF = pow(2,61)-1;
const ll INF = pow(2,30)-1;

vector<ll> fac;
void c_fac(ll x=pow(10,7)+10) { fac.resize(x,true); rep(i,x) fac[i] = i ? (fac[i-1]*i)%MOD : 1; }
ll inv(ll a, ll m=MOD) { ll b = m, x = 1, y = 0; while (b!=0) { ll d = a/b; a -= b*d; swap(a,b); x -= y*d; swap(x,y); } return (x+m)%m; }
ll nck(ll n, ll k) { return fac[n]*inv(fac[k]*fac[n-k]%MOD)%MOD; }
ll modpow(ll x, ll p) { ll result = 1, now = 1, pm = x; while (now<=p) { if (p&now) { result = result * pm % MOD; } now*=2; pm = pm*pm % MOD; } return result; }
ll gcd(ll a, ll b) { if (a<b) swap(a,b); return b==0 ? a : gcd(b, a%b); }
ll lcm(ll a, ll b) { return a/gcd(a,b)*b; }

struct query {
  ll T, X, Y;
};

// ----------------------------------------------------------------------
// ----------------------------------------------------------------------

struct SegTree {
  ll size;
  vector<ll> pos;
  SegTree(ll N) { size = 1; while(size<N) size<<=1; pos.resize(2*size,0); }
  ll operator[](const ll &x) const { return pos[x+size]; }

  void set(ll x, const ll v) { pos[x+size] = v; }
  void update(ll x, const ll v) { set(x,v); x+=size; while (x>>=1) operate(x); }
  ll query(ll a, ll b) {
    ll L = 0, R = 0;
    for (a+=size, b+=size; a<b; a>>=1, b>>=1) {
      if (a&1) { L = q(L,pos[a]); a++; }
      if (b&1) { b--; R = q(pos[b],R); }
    }
    return q(L,R);
  }
  void operate(ll i) { pos[i] = q(pos[i*2], pos[i*2+1]); }
  ll q(ll x, ll y) { return x^y; }
};

// ----------------------------------------------------------------------
// ----------------------------------------------------------------------

int main() {
  ll N, Q; cin >> N >> Q;
  ll A[N]; rep(i,N) cin >> A[i];
  query q[Q]; rep(i,Q) cin >> q[i].T >> q[i].X >> q[i].Y;

  SegTree st(N); rep(i,N) st.update(i,A[i]);
  rep(i,Q) {
    if (q[i].T==1) {
      q[i].X--;
      st.update(q[i].X,st[q[i].X]^q[i].Y);
    }
    else {
      q[i].X--;
      ll result = st.query(q[i].X,q[i].Y);
      cout << result << endl;
    }
  }  
  return 0;
}