#include <iostream>
using namespace std;
int n,k;
void dfs(int e){
	int x=n-e-2;
	if(e==0){
		cout<<k;
		return;
	}
	for(int i=0;i<=x;i++) cout<<"          ";
	cout<<"#include <iostream>"<<endl;
	for(int i=0;i<=x;i++) cout<<"          ";
	cout<<"using namespace std;"<<endl;
	for(int i=0;i<=x;i++) cout<<"          ";
	cout<<"int main(){"<<endl;
	for(int i=0;i<=x;i++) cout<<"          ";
	cout<<"    cout<<\"";
	if(e!=1) cout<<endl;
	dfs(e-1);
	if(e!=1) for(int i=0;i<=x;i++) cout<<"          ";
	cout<<"\"<<endl;"<<endl;
	for(int i=0;i<=x;i++) cout<<"          ";
	cout<<"    return 0;"<<endl;
	for(int i=0;i<=x;i++) cout<<"          ";
	cout<<"}"<<endl;
}
int main(){
	cin>>n>>k;
	dfs(n-1);
	return 0;
}