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