#include<bits/stdc++.h>
using namespace std;

deque<int> num;

int main(){
	int n,m;
	char now;
	cin>>n>>m;
	for(int i=0;i<n;i++){
		cin>>now;
		num.push_back(now-'0');
	}
	for(int j=0;j<m;j++){
		cin>>now;
		switch(now){
			case '*':
				num.push_back(0);
				printf("Size:%d\n",num.size());
				break;
			case '/':
				num.pop_back();
				printf("Size:%d\n",num.size());
				break;
			case '+':
				for(int i=num.size()-1;;i--){
					if(num[i+1]==1){
						num.assign(i+1,0);
					}else{
						num.assign(i+1,1);
						break;
					}
				}
				printf("Size:%d\n",num.size());
				break;
			case '-':
				for(int i=num.size()-1;;i--){
					if(num[i]==1){
						num.assign(i,0);
						break;
					}else{
						num.assign(i,1);
					}
				}
				printf("Size:%d\n",num.size());
				break;				
		}
	}
	for(int i=0;i<num.size();i++){
		int nnow=num[i];
		if(nnow==1){
			printf("1");
		}else{
			printf("0");
		}
	}
	printf("\n%d",num.size());
	
	return 0;
}