The harbor bell rings at the orchard lands of Applerun; Anaya weighs the day's shelves manifests and starts the calculations. 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 <= 363; 0 <= a[i],x <= 1000.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= n <= 363; 0 <= a[i],x <= 1000.
