Guests in an apple orchard

Suppose you have a log of times (in minute #, represented by an integer) that guests entered and exited an apple orchard. Can you write a program that identifies times the apple orchard has greater than 3 guests?

Note: The length of the "enter" array will always be the same length as the "exit" array.

For example:

Input:
enter = [1, 1, 1, 3, 4, 5, 6, 7] 
exit = [4, 5, 5, 6, 8, 9, 10, 12]
----
Output: 
[3, 4, 7]