def phi(p):
    phi = 0
    for i in range(len(p)):
        for j in range(i+1, len(p)):
            if p[i] > p[j]:
                phi += 1
    return phi

# Read input
n, k = map(int, input().split())
p = list(map(int, input().split()))
l = list(map(int, input().split()))

# Initialize variables
best_p = p.copy()
best_phi = phi(p)

# Try all possible exchanges
for i in range(n):
    for j in range(i+1, n):
        if abs(i - j) in l:  # Check if the distance is allowed
            p[i], p[j] = p[j], p[i]  # Exchange
            phi_p = phi(p)
            if phi_p < best_phi:  # Check if it's better than the current best
                best_p = p.copy()
                best_phi = phi_p
            p[i], p[j] = p[j], p[i]  # Undo the exchange

# Print the result
print(" ".join(map(str, best_p)))