Caravans arrive at the ivy courts of Vineward with crates of crates, and Tomas the ledger master must account for every last one. Task: Print the number of distinct values that appear in both arrays. Input format: First line: n and m. Second line: n integers. Third line: m integers. Output format: Print the size of the intersection. Constraints: 1 <= n <= 841; -1000000 <= a[i],x <= 1000000000.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= n <= 841; -1000000 <= a[i],x <= 1000000000.
