#include<iostream>
#include<cstring>
#include<string>
#include<cstdio>
#include<queue>
#include<cmath>
#include<algorithm>
using namespace std;
struct node{
	int s;
	int l,r;
}tree[100000];
void bulit(int l,int r,int n){
	tree[n].l=l;
	tree[n].r=r;
	if(l==r){
		cin >>tree[n].s;
		return;
	}
	bulit(l,(l+r)/2,n*2);
	bulit((l+r)/2+1,r,n*2+1);
	tree[n].s=tree[n*2].s+tree[n*2+1].s;
}
int n,m; 
int main(){
	cin >>n>>m;
	bulit(1,n,1);
	for(int i=1;i<=n*4;i++){
		cout <<i<<":["<<tree[i].l<<" "<<tree[i].r<<"]"<<tree[i].s<<endl;
	}
	return 0;
}