At the cedar groves of Balmcrest, Zephyr records each vials in a worn leather ledger. The guild wants answers, not guesses. 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 <= 256; 0 <= a[i],x <= 1000.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= n <= 256; 0 <= a[i],x <= 1000.
