#include<bits/stdc++.h>
using namespace std;
 
typedef long long ll;
 
#define fi first
#define se second
#define pii pair<int,int>
#define pll pair<long long,long long>
#define pb push_back
#define debug(x) cerr<<#x<<"="<<x<<endl
#define pq priority_queue
#define inf 1ll<<60
#define rep(i,a,b) for (int i=a;i<(b);i++)
#define MP make_pair
#define SZ(x) (int(x.size()))
#define mod 1000000007
#define ALL(x) x.begin(),x.end()
#define endl "\n"
void inc(ll &a,ll b) {a=(a+b)%mod;}
void dec(ll &a,ll b) {a=(a-b+mod)%mod;}
int lowbit(ll x) {return x&(-x);}

const ll maxn=222222;
ll dp1[maxn],dp2[maxn];
//at index i how many boxes are there (from the back)
//at index i what is the leftover amount at the last box
ll sum[maxn];
ll a[maxn];
int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	//freopen("i.txt","r",stdin);
	ll n,l;cin>>n>>l;
	rep(i,1,n+1){
		cin>>a[i];
	}
	rep(i,1,n+1){
		sum[i]=sum[i-1]+a[i];
	}
	sum[n+1]=inf;
	rep(i,1,n+1)cout<<sum[i]<<" ";
	cout<<endl;
	for(int i=n;i>0;i--){
		auto first=upper_bound(sum+1,sum+n+1,sum[i-1]+l)-sum;
		debug(first);
		dp1[i]=dp1[first]+1;
		if(dp1[i]>1){
			dp2[i]=dp2[first];
		}else{
			dp2[i]=sum[first-1]-sum[i-1];
		}
	}
	rep(i,1,n+1){
		cout<<dp1[i]<<" "<<dp2[i]<<endl;
	}
	return 0;
}