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

template<typename T>bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<typename T>bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}


// std::vector Declaration
template<typename T>
vector<T> make_v(size_t a) { return vector<T>(a); }
template<typename T,typename... Ts>
auto make_v(size_t a,Ts... ts) {
   return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));
}

// std::vector Initialization
template<typename T>
void fill_all(T& arr, const T& v) { arr = v; }
template<typename T, typename U>
void fill_all(T& arr, const U& v) { for (auto& i : arr) fill_all(i, v); }

// std::vector Debug
template<typename T>
ostream& operator<<(ostream& os, const vector<T>& v) {
   os << "[";
   bool a = 1;
   for (auto e : v ) {
      os << (a ? "" : " "); 
      os << e;
      a = 0;
   }
   os << "]";
   return os;
}

// std::pair Debug
template<typename T, typename U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
   os << "(" << p.first << " " << p.second << ")";
   return os;
}

// std::set Debug
template<typename T>
ostream& operator<<(ostream& os, const set<T>& st) {
   os << "{";
   bool a = 1;
   for (auto e : st) {
      os << (a ? "" : " ");
      os << e;
      a = 0;
   }
   os << "}";
   return os;
}

// std::map Debug
template<typename T, typename U>
ostream& operator<<(ostream& os, const map<T, U>& mp) {
   os << "{";
   bool a = 1;
   for (auto e : mp) {
      os << (a ? "" : " ");
      os << e.first << ":" << e.second;
      a = 0;
   }
   os << "}";
   return os;
}

// std::tuple Debug
template<int N,class Tuple>
void out(ostream &os,const Tuple &t){}
template<int N,class Tuple,class H,class ...Ts>
void out(ostream &os,const Tuple &t){
   if(N)os<<" ";
   os<<get<N>(t);
   out<N+1,Tuple,Ts...>(os,t);
}
template<class ...Ts>
ostream& operator<<(ostream &os, const tuple<Ts...> &t){
   os<<"(";
   out<0,tuple<Ts...>,Ts...>(os,t);
   os<<")";
   return os;
}

// Debug
#define DUMP(x) cout<<#x<<" = "<<(x)<<endl

struct edge { int to, cost; };

const LL LINF = 1LL<<60;
const int IINF = 1<<30;
const LL MOD = 1e9+7;


template< typename Monoid, typename OperatorMonoid = Monoid >
struct LazySegmentTree {
   using F = function< Monoid(Monoid, Monoid) >;
   using G = function< Monoid(Monoid, OperatorMonoid, int) >;
   using H = function< OperatorMonoid(OperatorMonoid, OperatorMonoid) >;
   int sz;
   vector< Monoid > data;
   vector< OperatorMonoid > lazy;
   const F f;
   const G g;
   const H h;
   const Monoid M1;
   const OperatorMonoid OM0;
   LazySegmentTree(int n, const F f, const G g, const H h,
         const Monoid &M1, const OperatorMonoid OM0)
      : f(f), g(g), h(h), M1(M1), OM0(OM0) {
         sz = 1;
         while(sz < n) sz <<= 1;
         data.assign(2 * sz, M1);
         lazy.assign(2 * sz, OM0);
      }
   void set(int k, const Monoid &x) {
      data[k + sz] = x;
   }
   void build() {
      for(int k = sz - 1; k > 0; --k) {
         data[k] = f(data[2 * k + 0], data[2 * k + 1]);
      }
   }
   void propagate(int k, int len) {
      if(lazy[k] != OM0) {
         if(k < sz) {
            lazy[2 * k + 0] = h(lazy[2 * k + 0], lazy[k]);
            lazy[2 * k + 1] = h(lazy[2 * k + 1], lazy[k]);
         }
         data[k] = g(data[k], lazy[k], len);
         lazy[k] = OM0;
      }
   }
   Monoid update(int a, int b, const OperatorMonoid &x, int k, int l, int r) {
      propagate(k, r - l);
      if(r <= a || b <= l) {
         return data[k];
      } else if(a <= l && r <= b) {
         lazy[k] = h(lazy[k], x);
         propagate(k, r - l);
         return data[k];
      } else {
         return data[k] = f(update(a, b, x, 2 * k + 0, l, (l + r) >> 1),
               update(a, b, x, 2 * k + 1, (l + r) >> 1, r));
      }
   }
   Monoid update(int a, int b, const OperatorMonoid &x) {
      // update [a, b) with x.
      return update(a, b, x, 1, 0, sz);
   }
   Monoid query(int a, int b, int k, int l, int r) {
      propagate(k, r - l);
      if(r <= a || b <= l) {
         return M1;
      } else if(a <= l && r <= b) {
         return data[k];
      } else {
         return f(query(a, b, 2 * k + 0, l, (l + r) >> 1),
               query(a, b, 2 * k + 1, (l + r) >> 1, r));
      }
   }
   Monoid query(int a, int b) {
      // return f[a, b).
      return query(a, b, 1, 0, sz);
   }
   Monoid operator[](const int &k) {
      return query(k, k + 1);
   }
};

int main()
{
   int n, q; cin >> n >> q;
   vector<int> c(q), s(q), t(q), x(q), idx(q);
   for (int i = 0; i < q; ++i) {
      cin >> c[i];
      if (c[i] == 0) {
         cin >> s[i] >> t[i] >> x[i];
         --s[i];
         --t[i];
      } else {
         cin >> idx[i];
         --idx[i];
      }
   }
   auto raq = LazySegmentTree<int>(n,
         [](int a, int b){ return max(a,b); },
         [](int a, int b, int w){ return a+b*w; },
         [](int a, int b){ return a+b; },
         0, 0);

   for (int i = 0; i < q; ++i) {
      if (c[i] == 0) {
         raq.update(s[i], t[i]+1, x[i]);
      } else {
         cout << raq.query(idx[i], idx[i]+1) << endl;
      }
   }

   return 0;
}



Measured memory_bytes: 6820