def get_Position(a, n, m):
    # Simulate removing every m-th element from the array
    # Return the position (1-indexed) of the last removed element
    
    remaining = list(range(1, n + 1))  # 1-indexed positions
    current = 0  # starting index
    last_removed = None
    
    while remaining:
        current = (current + m - 1) % len(remaining)
        last_removed = remaining[current]
        remaining.pop(current)
        if current == len(remaining):
            current = 0
    
    return last_removed