#include<algorithm>
#include<iostream>
#include<cstring>
#include<vector>
#include<cstdio>using namespace std;
#define lson l, m, rt << 1
#define rson m + 1, r, rt << 1|1
const int N = 100000 + 5;
typedef long long LL;
struct node{int p, l, r, v;node(){}node(int p, int l, int r, int v): p(p), l(l), r(r), v(v){}node(int p, int v): p(p), v(v){}
}Node[N];
LL sum[N << 4], add[N << 4];vector<int> X;void PushDown(int rt, int m){if(add[rt]){add[rt << 1] += add[rt];add[rt << 1|1] += add[rt];sum[rt << 1] += (LL)add[rt]*(m - (m >> 1));sum[rt << 1|1] += (LL)add[rt]*(m >> 1);add[rt] = 0;}
}
void Build(int l, int r, int rt){add[rt] = sum[rt] = 0;if(l == r) return;int m = (l + r) >> 1;Build(lson);Build(rson);
}void Updata(int L, int R, int c, int l, int r, int rt){if(L <= l && r <= R){add[rt] += c;sum[rt] += (LL)c*(r - l + 1);return;}PushDown(rt, r - l + 1);int m = (l + r) >> 1;if(L <= m) Updata(L, R, c, lson);if(R > m) Updata(L, R, c, rson);
}LL Query(int p, int l, int r, int rt){if(l == r) return sum[rt];PushDown(rt, r - l + 1);int m = (l + r) >> 1;if(p <= m) return Query(p, lson);return Query(p, rson);
}int Binary(int x){return distance(X.begin(), lower_bound(X.begin(), X.end(), x));
}int dic(){sort(X.begin(), X.end());X.erase(unique(X.begin(), X.end()), X.end());return X.size() - 1;
}
int main(){int  n, m, p, l, r, c;scanf("%d %d", &n, &m);for(int i = 1; i <= m; i++){scanf("%d", &p);if( p == 1){scanf("%d", &c);X.push_back( c );Node[i] = node(p, c);}else{scanf("%d %d %d", &l, &r, &c);X.push_back( l );X.push_back( r );Node[i] = node(p, l, r, c);}}int k = dic();Build(0, k, 1);for(int i = 1; i <= m; i++){if(Node[i].p == 0){l = Binary(Node[i].l);r = Binary(Node[i].r);c = Node[i].v;Updata(l, r, c, 0, k, 1);}else{c = Binary(Node[i].v);printf("%lld\n", Query(c, 0, k, 1));}}
}