```python
def find_Divisor(x, y):
    """
    Finds the maximum occurring divisor in the interval [x, y].

    It is assumed that "divisor" implies a divisor greater than 1.
    If multiple divisors share the maximum frequency, the smallest such divisor is returned.

    Args:
        x: The starting integer of the interval (inclusive).
        y: The ending integer of the interval (inclusive).

    Returns:
        The integer that is the maximum occurring divisor in the interval [x, y].
    """
    if x == y:
        num = x
        if num == 1:
            return 1
        
        # If the interval contains a single number, all its divisors (other than 1)
        # occur exactly once. We return the smallest one as a tie-breaker.
        # The smallest divisor of a number greater than 1 is its smallest prime factor.
        
        if num % 2 == 0:
            return 2
        
        i = 3
        while i * i <= num:
            if num % i == 0:
                return i
            i += 2
            
        # If no smaller divisor is found, the number itself is prime.
        return num
    else:
        # If the interval contains more than one number (i.e., x < y),
        # it must contain at least one even number. The count of the divisor 2
        # will be greater than or equal to the count of any other divisor d > 2.
        # In case of a tie, 2 is the smallest possible candidate, so we return it.
        return 2

```