#include <stdio.h>

#define SUM 100000

int n, a[100], s_sum[SUM], s_ans[SUM + 1][100], s_c = 1;
long long int x, l_sum[1<<20], l_c;
int b[100], b_copy[100], index_[100], i_copy[100], rank[100];

void sort(int l, int r) {
	if(l == r) { return; }
	
	int m = (l + r) / 2;
	sort(l    , m);
	sort(m + 1, r);
	
	int lc = l, rc = m + 1, cc = l;
	while(cc <= r) {
		if(r < rc || (lc <= m && b[lc] >= b[rc]) ) {
			b_copy[cc] = b[lc];
			i_copy[cc] = index_[lc];
			lc++; cc++;
		} else {
			b_copy[cc] = b[rc];
			i_copy[cc] = index_[rc];
			rc++; cc++;
		}
	}
	
	int i;
	for(i = l; i <= r; i++) {
 		b[i] = b_copy[i];
		index_[i] = i_copy[i];
	}
	
	 return;
}

int main(void) {
	s_sum[0] = s_c;
	s_c++;
	
	scanf("%d%lld", &n, &x);
	
	int i, j, k, l_c = 0;
	for(i = 0; i < n; i++) {
		scanf("%d", &a[i]);
		b[i] = a[i];
		index_[i] = i;
	}
	
	sort(0, n - 1);
	for(i = 0; i < n; i++) {
		rank[ index_[i] ] = i;
	}
	
	for(i = 0; i < n; i++) {
		if(20 <= rank[i]) {
			for(j = SUM - 1; 0 <= j; j--) {
				if(s_sum[j] != 0 && s_sum[ j + a[i] ] == 0) {
					for(k = 0; k < i; k++) {
						s_ans[s_c][k] = s_ans[ s_sum[j] ][k];
					}
					s_ans[s_c][i] = 1;
					s_sum[ j + a[i] ] = s_c;
					s_c++;
				}
			}
		} else {
			for(j = 0; j < (1 << l_c); j++) {
				l_sum[ j + (1 << l_c) ] = l_sum[j] + a[i];
			}
			l_c++;
		}
	}
	
	int flag = 0;
	for(j = 0; j < (1 << l_c); j++) {
		long long int v = x - l_sum[j];
		if(0 <= v && v < SUM && s_sum[v] != 0) {
			flag = 1;
			for(i = 0; i < n; i++) {
				if(20 <= rank[i]) {
					printf("%c", s_ans[ s_sum[v] ][i] ? 'o' : 'x');
				} else {
					printf("%c", j % 2 ? 'o' : 'x');
					j /= 2;
				}
			}
			printf("\n");
			break;
		}
	}
	
	if(! flag) { printf("No\n"); }
	
	return 0;
}