#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")


int N, K;
char S[50];

bitset<2510> dp[50][50][50];

int main() {
  for (; ~scanf("%d%d", &N, &K); ) {
    scanf("%s", S);
    
    for (int i = 0; i <= N; ++i) {
      for (int x = 0; x <= i; ++x) for (int y = 0; y <= N - i; ++y) {
        dp[i][x][y].reset();
      }
    }
    for (int y = 0; y <= N; ++y) {
      dp[0][0][y].set(0);
    }
    for (int i = 0; i < N; ++i) {
      const char s = (~string("NAC?").find(S[i])) ? S[i] : '-';
      for (int x = 0; x <= i; ++x) for (int y = 0; y <= N - i; ++y) {
        const auto &f = dp[i][x][y];
        if (s == '?' || s == 'N') dp[i + 1][x + 1][y] |= f;
        if (s == '?' || s == 'A') dp[i + 1][x][y] |= f << (x * y);
        if (s == '?' || s == 'C') if (y) dp[i + 1][x][y - 1] |= f;
        if (s == '?' || s == '-') dp[i + 1][x][y] |= f;
      }
    }
    int xm = -1;
    for (int x = 0; x <= N; ++x) if (dp[N][x][0][K]) {
      xm = x;
      break;
    }
    if (~xm) {
      string ans = S;
      int x = xm, y = 0, k = K;
      for (int i = N; --i >= 0; ) {
        const char s = (~string("NAC?").find(S[i])) ? S[i] : '-';
        assert(dp[i + 1][x][y][k]);
        if (s == '?' || s == 'N') if (x && dp[i][x - 1][y][k]) { ans[i] = 'N'; --x; continue; }
        if (s == '?' || s == 'A') if (k >= x * y && dp[i][x][y][k - x * y]) { ans[i] = 'A'; k -= x * y; continue; }
        if (s == '?' || s == 'C') if (dp[i][x][y + 1][k]) { ans[i] = 'C'; ++y; continue; }
        if (s == '?' || s == '-') if (dp[i][x][y][k]) { ans[i] = (S[i] == '?') ? 'O' : S[i]; continue; }
        assert(false);
      }
      puts(ans.c_str());
    } else {
      puts("-1");
    }
  }
  return 0;
}