{"raw_statement":[{"iden":"problem statement","content":"We have two strictly increasing integer sequences $A = (A_1, A_2, \\dots, A_N)$ and $B = (B_1, B_2, \\dots, B_M)$.  \nFind all integers that appear in exactly one of $A$ and $B$ and print them in ascending order."},{"iden":"constraints","content":"*   All values in input are integers.\n*   $1 \\leq N, M \\leq 10^3$\n*   $1 \\leq A_1 < A_2 < \\dots < A_N \\leq 10^3$\n*   $1 \\leq B_1 < B_2 < \\dots < B_M \\leq 10^3$"},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$N$ $M$\n$A_1$ $A_2$ $\\cdots$ $A_N$\n$B_1$ $B_2$ $\\cdots$ $B_M$"},{"iden":"sample input 1","content":"2 2\n1 2\n1 3"},{"iden":"sample output 1","content":"2 3\n\n$1$ is contained in both $A$ and $B$;  \n$2$ is contained in only $A$;  \n$3$ is contained in only $B$.  \nThus, we should print $2$ and $3$."},{"iden":"sample input 2","content":"4 4\n1 2 3 4\n1 2 3 4"},{"iden":"sample output 2","content":"You can print an empty line or nothing."}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}