#include<bits/stdc++.h>
using namespace std;
#define f(i,a,b) for(int i=a;i<b;i++)
int n,k;
void dfs(int floor){
	if(floor==-1){
		cout<<k;
		return ;
	}
	if(floor==0){
		putchar(34);
		cout<<"#include<iostream>";putchar(34);cout<<endl;
	    cout<<"cout<<";putchar(34);cout<<"using namespace std;";putchar(34);cout<<endl;
	    cout<<"cout<<";putchar(34);cout<<"int main(){cout<<"<<k<<"<<endl;return 0;}";putchar(34);
		return ;
	}
	if(floor!=n-2){
		putchar(34);
	}
	cout<<"#include<iostream>";cout<<endl;
	cout<<"using namespace std;";cout<<endl;
	cout<<"int main(){cout<<";
	dfs(floor-1);
	cout<<"<<endl;return 0;}";
	if(floor!=n-2){
		putchar(34);
	}
	cout<<endl;
	return ;
}
int main(){
    cin>>n>>k;
    dfs(n-2);
	return 0;
}