{"problem":{"name":"Xor of Sequences","description":{"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)$.   Find all integers that appear in exactly one of $A$ and $B$ and print them in ascendi","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"jsc2021_b"},"statements":[{"statement_type":"Markdown","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.\n\n## Constraints\n\n*   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$\n\n## Input\n\nInput 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$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"jsc2021_b","tags":[],"sample_group":[["2 2\n1 2\n1 3","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$."],["4 4\n1 2 3 4\n1 2 3 4","You can print an empty line or nothing."]],"created_at":"2026-03-03 11:01:14"}}