#include <bits/stdc++.h>
inline int min(const int &first, const int &second) {
  return (((second - first) >> (32 - 1)) & (first ^ second)) ^ first;
}
inline int max(const int &first, const int &second) {
  return (((second - first) >> (32 - 1)) & (first ^ second)) ^ second;
}
inline long long min(const long long &first, const long long &second) {
  return (((second - first) >> (64 - 1)) & (first ^ second)) ^ first;
}
inline long long max(const long long &first, const long long &second) {
  return (((second - first) >> (64 - 1)) & (first ^ second)) ^ second;
}
using namespace std;
char string_in_buffer[(int)260];
void fast_scan(int &first) { scanf("%d", &first); }
void fast_scan(long long &first) { scanf("%lld", &first); }
void fast_scan(unsigned long long &first) { scanf("%llu", &first); }
void fast_scan(double &first) { scanf("%lf", &first); }
void fast_scan(long double &first) { scanf("%Lf", &first); }
void fast_scan(char &first) {
  scanf("%c", &first);
  if (first == '\n') {
    fast_scan(first);
  }
}
void fast_scan(string &first) {
  scanf("%s", string_in_buffer);
  first = string(string_in_buffer);
}
template <class TFirst, class TSecond>
void fast_scan(pair<TFirst, TSecond> &p) {
  fast_scan(p.first);
  fast_scan(p.second);
}
template <class T>
void fast_scan(vector<T> &v) {
  for (auto &first : v) fast_scan(first);
}
void fast_print(const int &first) { printf("%d", first); }
void fast_print(const unsigned int &first) { printf("%u", first); }
void fast_print(const long long &first) { printf("%lld", first); }
void fast_print(const unsigned long long &first) { printf("%llu", first); }
void fast_print(const double &first) { printf("%.15lf", first); }
void fast_print(const long double &first) { printf("%.15Lf", first); }
void fast_print(const char &first) { printf("%c", first); };
void fast_print(const string &first) { printf("%s", first.c_str()); }
void fast_print(const char v[]) { fast_print((string)v); }
template <class TFirst, class TSecond>
void fast_print(const pair<TFirst, TSecond> &p) {
  fast_print(p.first);
  fast_print(' ');
  fast_print(p.second);
}
template <class T>
void fast_print(const vector<T> &v) {
  if (v.empty()) return;
  fast_print(v[0]);
  for (int i = 1; i < v.size(); i++) {
    fast_print(' ');
    fast_print(v[i]);
  }
}
template <class T>
void fast_print(const vector<vector<T>> &v) {
  if (v.empty()) return;
  fast_print(v[0]);
  for (int i = 1; i < v.size(); i++) {
    fast_print('\n');
    fast_print(v[i]);
  }
}
template <class T>
void fast_print(const T &v) {
  for (const auto &first : v) {
    fast_print(first);
    fast_print(' ');
  }
}
using namespace std;
namespace smart_io {
string print_start = "";
string sep = " ";
bool first_print = false;
void precall_print() {
  fast_print(print_start);
  print_start = "\n";
  first_print = true;
}
void _print(deque<string>) {}
template <class T, class... Args>
void _print(deque<string> names, T elem, Args... args) {
  if (!first_print) {
    fast_print("\n");
  } else {
    first_print = false;
  }
  fast_print(names.front());
  fast_print(" = ");
  fast_print(elem);
  names.pop_front();
  _print(names, args...);
}
}  // namespace smart_io
template <class T>
ostream &operator,(ostream &os, const T &object) {
  if (!smart_io::first_print) {
    fast_print(smart_io::sep);
  } else {
    smart_io::first_print = false;
  }
  fast_print(object);
  return os;
}
template <class T>
istream &operator,(istream &is, T &object) {
  fast_scan(object);
  return is;
}
namespace escape__from__random__aetuhoetnuhshe {
using namespace std::chrono;
mt19937 rng(duration_cast<milliseconds>(system_clock::now().time_since_epoch())
                .count());
uniform_real_distribution<> prob_dist(0.0, 1.0);
};  // namespace escape__from__random__aetuhoetnuhshe
namespace typedefs {}
namespace numbers_operation {
template <class T>
T floor_mod(T a, T b) {
  if (a >= 0 && b >= 0) return a % b;
  if (a <= 0 && b <= 0) return a % b;
  return abs(b) - (abs(a) % abs(b));
}
}  // namespace numbers_operation
using namespace numbers_operation;
using namespace typedefs;
using namespace escape__from__random__aetuhoetnuhshe;
int n, q;
vector<int> v;
const int N = 1e5 + 10;
int T[N];
void inc(int i, int d) {
  for (; i < N; i = (i | (i + 1))) {
    T[i] += d;
  }
}
int get(int i) {
  int r = 0;
  for (; i > -1; i = (i & (i + 1)) - 1) {
    r += T[i];
  }
  return r;
}
int offset = 1e5;
signed main(signed argc, char *argv[]) {
  cin, n, q;
  v.resize(n);
  cin, v;
  vector<pair<string, int>> acts;
  vector<int> lessR(2 * offset + 10, -1), greaterR(2 * offset + 10, -1);
  vector<vector<int>> swapsL(2 * offset + 10), swapsG(2 * offset + 10);
  for (int i = 0; i < (q); i++) {
    string sign;
    int first;
    cin, sign, first;
    acts.emplace_back(sign, first);
    if (sign == "<") {
      lessR[offset + first] = max(lessR[offset + first], i);
      if (first > 0) {
        inc(i, 1);
        swapsL[offset + first].push_back(i);
      }
    } else {
      greaterR[offset + first] = max(greaterR[offset + first], i);
      if (first < 0) {
        inc(i, 1);
        swapsG[offset + first].push_back(i);
      }
    }
  }
  vector<vector<int>> at(offset + 10);
  for (int i = 0; i < n; i++) {
    at[abs(v[i])].push_back(i);
  }
  vector<int> rez(n, 0);
  int G = -1;
  int L = -1;
  for (int i = 1; i <= offset; i++) {
    L = max(L, lessR[offset - i + 1]);
    L = max(L, lessR[offset + i]);
    G = max(G, greaterR[offset - i]);
    G = max(G, greaterR[offset + i - 1]);
    for (int j : swapsL[offset + i]) {
      inc(j, -1);
    }
    for (int j : swapsG[offset - i]) {
      inc(j, -1);
    }
    if (L == -1 && G == -1) {
      int total = get(N - 1);
      for (int j : at[i]) {
        if (total % 2 == 0) {
          rez[j] = v[j];
        } else {
          rez[j] = -v[j];
        }
      }
    } else if (L > G) {
      int total = get(N - 1) - get(L);
      for (int j : at[i]) {
        if (total % 2 == 0) {
          rez[j] = i;
        } else {
          rez[j] = -i;
        }
      }
    } else {
      int total = get(N - 1) - get(G);
      for (int j : at[i]) {
        if (total % 2 == 0) {
          rez[j] = -i;
        } else {
          rez[j] = i;
        }
      }
    }
  }
  smart_io::precall_print();
  cout, rez;
}
