# include using namespace std; typedef long long ll; typedef pair P; const int N = 310; const int M = 50010; P A[N]; int n, t, cnt = 0, dp[N * M]; bool use[N]; int main() { scanf("%d%d", &n, &t); for (int i = 0; i < n; i++) { scanf("%d", &A[i].first); A[i].second = i; } sort(A, A + N); memset(dp, -1, sizeof(dp)); dp[0] = 0; while (cnt < N && A[cnt].first < M) cnt++; for (int i = 0; i < cnt; i++) { for (int j = (i + 1) * A[i].first; j >= A[i].first; j--) { if (dp[j] != -1) continue; if (dp[j - A[i].first] == -1) continue; dp[j] = i; } } int res = n - cnt; for (int s = 0; s < (1 << res); s++) { ll sum = 0; for (int i = 0; i < res; i++) { if ((s >> i) & 1) sum += A[cnt + i].first; } ll tar = t - sum; if (0 <= tar && tar < N * M && dp[tar] != -1) { for (int i = 0; i < res; i++) { if ((s >> i) & 1) use[A[i + cnt].second] = true; } ll now = tar; while (now != 0) { use[A[dp[now]].second] = true; now -= A[dp[now]].first; } // puts("Yes"); for (int i = 0; i < N; i++) printf(use[i] ? "o" : "x"); printf("\n"); exit(0); } } puts("No"); return 0; }