```python
import collections

def get_Position(a, n, m):
    if n <= 1:
        return -1

    positions = collections.deque(range(n))
    
    last_removed_position = -1
    
    while len(positions) > 1:
        # To select the m-th element, we need to step forward m-1 times
        # from the current starting position. A negative rotation on a deque
        # is a rotation to the left. This brings the target element
        # to the front (index 0) of the deque.
        positions.rotate(-(m - 1))
        
        # Remove the element at the front and store its original position.
        # This element is the one that was at the m-th position in the circle.
        last_removed_position = positions.popleft()
        
    return last_removed_position
```