The council of the mountain city of Highreach pays by the answer, and Nico intends to earn it. First: the full register of crates. 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 <= 509; -1000000000 <= a[i],x <= 1000.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= n <= 509; -1000000000 <= a[i],x <= 1000.
