#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
struct fastio {
  char s[100000];
  int it, len;
  fastio() { it = len = 0; }
  inline char get() {
    if (it < len) return s[it++];
    it = 0;
    len = fread(s, 1, 100000, stdin);
    if (len == 0)
      return EOF;
    else
      return s[it++];
  }
  bool notend() {
    char c = get();
    while (c == ' ' || c == '\n') c = get();
    if (it > 0) it--;
    return c != EOF;
  }
} _buff;
inline long long getnum() {
  long long r = 0;
  bool ng = 0;
  char c;
  c = _buff.get();
  while (c != '-' && (c < '0' || c > '9')) c = _buff.get();
  if (c == '-') ng = 1, c = _buff.get();
  while (c >= '0' && c <= '9') r = r * 10 + c - '0', c = _buff.get();
  return ng ? -r : r;
}
template <class T>
inline void putnum(T x) {
  if (x < 0) putchar('-'), x = -x;
  register short a[20] = {}, sz = 0;
  while (x) a[sz++] = x % 10, x /= 10;
  if (sz == 0) putchar('0');
  for (int i = sz - 1; i >= 0; i--) putchar('0' + a[i]);
}
inline char getreal() {
  char c = _buff.get();
  while (c <= 32) c = _buff.get();
  return c;
}
long long qpow(long long x, long long k) {
  return k == 0 ? 1
                : 1ll * qpow(1ll * x * x % mod, k >> 1) * (k & 1 ? x : 1) % mod;
}
const int maxn = 100111;
int n, q;
int a[maxn];
bool LZ;
vector<pair<int, int> > V;
void add(int x, int sgn) {
  if (LZ) sgn = -sgn;
  while (V.size() > 0 && V.back().first >= x) V.pop_back();
  V.push_back(make_pair(x, sgn));
}
void go(char op, int x) {
  if (op == '>') {
    if (x + 1 >= 0) {
      add(x + 1, -1);
    } else {
      go('<', x + 1);
      LZ ^= 1;
    }
  } else {
    if (-x + 1 >= 0) {
      add(-x + 1, 1);
    } else {
      go('>', x - 1);
      LZ ^= 1;
    }
  }
}
int targ[maxn];
int query(int x) {
  int ret;
  if (targ[abs(x)] == 0)
    ret = x;
  else
    ret = targ[abs(x)];
  if (LZ) ret = -ret;
  return ret;
}
int main() {
  n = getnum(), q = getnum();
  for (int i = 1; i <= n; i++) a[i] = getnum();
  LZ = 0;
  for (int i = 1; i <= q; i++) {
    char c = getreal();
    int x;
    x = getnum();
    go(c, x);
  }
  V.push_back(make_pair(100001, 1));
  for (int i = 0; i + 1 < V.size(); i++) {
    for (int j = V[i].first; j < V[i + 1].first; j++) targ[j] = j * V[i].second;
  }
  for (int i = 1; i <= n; i++) putnum(query(a[i])), putchar(' ');
  return 0;
}
