{"trustable":false,"sections":[{"title":"","value":{"format":"MD","content":"Little Basilisk is very fond of array. He has **m** integers stored at his array **B**. One day, Basilisk wakes up, and finds some integers are missing. Yes, you are right. Harry Potter has stolen some numbers again and left Basilisk with array **A** having **n** integers.\nNow, Basilisk is very poor at math. He comes to you to help him to find out the integers that are missing. Given two arrays of integers, find which elements in the second array are missing from the first array. You have to print the missing numbers sorted ascending. "}},{"title":"","value":{"format":"MD","content":"**Example**\n\nA \u003d [7, 2, 5, 3, 5, 3]\nB \u003d [7, 2, 5, 4, 6, 3, 5, 3]\n\n**B** is the original array. The missing numbers are [4, 6]"}},{"title":"","value":{"format":"MD","content":"**Input Format**\n\nThere will be four lines of input:\n\n- n - the size of the first list, A\n- The next line contains n space-separated integers A[i]\n- m - the size of the second list, B\n- The next line contains m space-separated integers B[i]"}},{"title":"","value":{"format":"MD","content":"**Constraints**\n\n- 1 \u003c\u003d n , m \u003c\u003d 200000\n- n\u003c\u003dm\n- 1 \u003c\u003d B[i] \u003c\u003d 10000\n- max(B) - min(B) \u003c\u003d 100"}},{"title":"","value":{"format":"MD","content":"**Sample Input**\n\n10\n203 204 205 206 207 208 203 204 205 206\n13\n203 204 204 205 206 207 205 208 203 206 205 206 204\n\n**Sample Output**\n\n204 205 206\n\n**Explanation**\n\n204 is present in both arrays. But its frequency in array A is 2, while its frequency in array B is 3. \nSimilarly, 205 and 206 occur twice in A , but three times in B. \nThe rest of the numbers have the same frequencies in both lists."}}]}