#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long int ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;
typedef vector<vvvl> vvvvl;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<vvb> vvvb;
typedef vector<vvvb> vvvvb;
typedef pair<ll,ll> pl;
typedef pair<ll,pl> ppl;
typedef pair<ll,ppl> pppl;
typedef pair<ll,pppl> pppppl;
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define all(a) begin(a),end(a)
#define sz(a) (int)(a).size()
#define F first
#define S second
#define bs(A,x) binary_search(all(A),x)
#define lb(A,x) (ll)(lower_bound(all(A),x)-A.begin())
#define ub(A,x) (ll)(upper_bound(all(A),x)-A.begin())
#define cou(A,x) (ll)(upper_bound(all(A),x)-lower_bound(all(A),x))
template<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;
template<class T>bool chmax(T&a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T&a,T b){if(b<a){a=b;return 1;}return 0;}
/*
using mint=modint998244353;
const ll mod=998244353;
//*/
/*
using mint=modint1000000007;
const ll mod=1000000007;
/*/
using mint=modint;
//*
typedef vector<mint> vm;
typedef vector<vm> vvm;
typedef vector<vvm> vvvm;
typedef vector<vvvm> vvvvm;
ostream&operator<<(ostream&os,mint a){os<<a.val();return os;}
istream&operator>>(istream&is,mint&a){int x;is>>x;a=mint(x);return is;}
//*/
template<typename T1,typename T2>ostream&operator<<(ostream&os,pair<T1,T2>p){os<<p.F<<" "<<p.S;return os;}
template<typename T1,typename T2>istream&operator>>(istream&is,pair<T1,T2>&p){is>>p.F>>p.S;return is;}
template<typename T>ostream&operator<<(ostream&os,vector<T>v){rep(i,0,sz(v))os<<v[i]<<(i+1!=sz(v)?" ":"");return os;}
template<typename T>istream&operator>>(istream&is,vector<T>&v){for(T&in:v)is>>in;return is;}
ll f(ll N){
	const __int128 mod=7000000001;
	vector<__int128>p10(23,1);
	rep(i,1,23)p10[i]=p10[i-1]*10;
	vector<__int128>q10(23);
	rep(i,0,23)q10[i]=p10[i]%mod;
	__int128 ans=0;
	rep(d,1,24){
    if(p10[d-1]>N)break;
		if(N>=p10[d]-1){
			rep(i,1,d)ans+=q10[i]*45*9%mod*q10[d-2]%mod;
			ans+=45*q10[d-1]%mod;
			ans%=mod;
		}
		else{
			//[10^{d-1},N]
			ll t=N/p10[d-1];
			rep(i,1,t)ans+=i*q10[d-1]%mod,ans%=mod;
			ans+=t%mod*((N%mod+1-t%mod*q10[d-1]%mod)%mod)%mod;
			ans%=mod;
			N-=p10[d-1];N++;
			//[0,N)
			rep(i,1,d){
				ll s=0;
				ll p=N/p10[d-1-i],q=N-p*p10[d-1-i];
				s=(p%10)*(q%mod)%mod;
				s+=(p/10)%mod*45*q10[d-1-i]%mod;
				s%=mod;
				rep(j,0,p%10)s+=j*q10[d-1-i]%mod,s%=mod;
				s%=mod;
				ans+=q10[i]*s%mod;
				ans%=mod;
			}
			break;
		}
	}
	return ans%mod;
}
int main(){
  cin.tie(0)->sync_with_stdio(0);
  cin.exceptions(cin.failbit);
  ll Q,L;cin>>Q>>L;
  ll ans=0;
  while(Q--){
  	ll t,l,r,c;cin>>t>>l>>r>>c;
  	if(t==1)ans+=c;
  	else ans-=c;
  	cout<<ans<<endl;
  }
  return 0;
}