#include "bits/stdc++.h"
using namespace std;
typedef long long LL;
const int INF = 0x3f3f3f3f;
struct BST {int value;BST* lson;BST* rson;
}* root;
void remove(int value);
BST* init(int val) {BST* point = (BST*)malloc(sizeof(BST));point->value = val;point->lson = point->rson = NULL;return point;
}
void insert(int val) {BST* father = NULL;BST* now = root;while (now != NULL) {if (now->value == val) {return;}father = now;if (now->value < val) {now = now->rson;} else {now = now->lson;}}if (father == NULL) {root = init(val);} else if (father->value < val) {father->rson = init(val);} else {father->lson = init(val);}
}
/*这题的难点在于删除一个节点，思路是:当要删除的节点右子树不为空时，用右子树中的最小值代替要删除的节点的值，同时删除右子树中值最小的节点否则右子树为空，可以用左子树代替当前位置当要删除的节点是唯一节点时,将root置为空
*/
int findAndRemoveMin(BST* point) {while (point->lson != NULL) {point = point->lson;}int ans = point->value;remove(ans);return ans;
}
void remove(int value) {BST* father = NULL;BST* now = root;while (now != NULL) {if (now->value == value) {if (now->rson != NULL) {now->value = findAndRemoveMin(now->rson);} else {if (father == NULL) {root = root->lson;} else if (now->value > father->value) {father->rson = now->lson;} else {father->lson = now->lson;}free(now);}return;}father = now;if (now->value < value) {now = now->rson;} else {now = now->lson;}}
}
//二叉搜索树中序遍历后会得到一个升序数列，这里用递归写起来很方便；
void ergodic(BST* point) {if (point == NULL) {return;}ergodic(point->lson);printf("%d ", point->value);ergodic(point->rson);
}
int main() {int N, M, value;scanf("%d%d", &N, &M);while (N--) {scanf("%d", &value);insert(value);ergodic(root);puts("");}while (M--) {scanf("%d", &value);remove(value);ergodic(root);puts("");}return 0;
}

void ergodic(BST* point) {stack<BST*> sta;while (point != NULL || !sta.empty()) {while (point != NULL) {sta.push(point);point = point->lson;}point = sta.top();sta.pop();printf("%d ", point->value);point = point->rson;}
}