Go: package main

import (
	"bufio"
	"os"
	"strings"
	"strconv"
	"fmt"
)

var scanner = bufio.NewScanner(os.Stdin)

const INF = 0x7FFFFFFF

func main() {
	for scanner.Scan() {
		buf := strings.Split(scanner.Text(), " ")
		n, _ := strconv.Atoi(buf[0])
		m, _ := strconv.Atoi(buf[1])
		if n == 0 && m == 0 {
			break
		}
		chair := make([]string, n+1)
		for i := range chair {
			chair[i] = "#"
		}
		chair[n] = "Sentinel"
		for i := 0; i < m; i++ {
			scanner.Scan()
			switch who := scanner.Text(); who {
			case "A": // 左から眺めて行って空いている席があったら即座に座る
				for j := 0; j < n; j++ {
					if chair[j] == "#" {
						chair[j] = "A"
						break
					}
				}
				// log.Println(chair)
				break // 次の人を読み込む
			case "B":
				flag := true
				// 右端からAの隣でない席を探していく
				for j := n-1; j > -1; j-- {
					if chair[j] == "#" && (j == 0 || chair[j-1] != "A") && chair[j+1] != "A" {
						flag = false
						chair[j] = "B"
						break
					}
				}
				// Aの隣しか空いていないので一番左端の空いている席に座る
				if flag {
					for j := 0; j < n; j++ {
						if chair[j] == "#" {
							chair[j] = "B"
							break
						}
					}
				}
				// log.Println(chair)
				break // 次の人を読み込む
			case "C":
				if i == 0 {
					chair[n/2] = "C" // 先客が誰もいないときは真ん中の椅子に座る
				} else {
					for j := 0; j < n; j++ { // 左から舐めて
						if chair[j] != "#" { // その席が空いていなくて
							if chair[j+1] == "#" { // 右隣が空いているなら座る
								chair[j+1] = "C"
								break
							} else if j != 0 && chair[j-1] == "#" { // 右隣が空いていないので左隣に座る
								chair[j-1] = "C"
								break
							}
						}
					}
				}
				// log.Println(chair)
				break // 次の人を読み込む
			case "D":
				distanceTable := make([]int ,n)
				for j := range distanceTable {
					distanceTable[j] = INF
				}
				for j:= 0; j < n; j++ {
					if chair[j] != "#" {
						for k := 0; k < n; k++ {
							distanceTable[k] = min(distanceTable[k], abs(j-k))
						}
					}
				}
				// log.Println("distanceTAble:", distanceTable)
				at := 0
				distance := 0
				for j := 0; j < n; j++ {
					if distance < distanceTable[j] {
						at = j
						distance = distanceTable[j]
					}
				}
				chair[at] = "D"
				// log.Println(chair)
				break // 次の人を読み込む
			}
		}
		fmt.Println(strings.Join(chair[:len(chair)-1], ""))
	}
}

func min(a, b int) int {
	if a > b {
		return b
	}
	return a
}

func abs(a int) int {
	if a < 0 {
		return -a
	}
	return a
}

C++: #define _CRT_SECURE_NO_WARNINGS
#include<cstdio>
#include<cmath>
#include<sstream>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<utility>
#include<iomanip>
#include<vector>
#include<string>
#include<queue>
#include<stack>
#include<map>
#include<list>
#include<set>
#include<stdlib.h>
#include<time.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define repp(i,k,n) for(int i=k;i<(int)n;i++)
using namespace std;
const int dx[4] = { 0, 1, 0, -1 }, dy[4] = { 1, 0, -1, 0 };
const int dX[8] = { 0, 1, 1, 1, 0, -1, -1, -1 }, dY[8] = { 1, 1, 0, -1, -1, -1, 0, 1 };
struct XY
{
	int x;
	int y;
};
vector<long long> Prime;
void SieveOfEratosthenes(long long e) //setup vector<long long>Prime(~x)
{
	bool *x=new bool[e];
	for (long long i = 0; i <= e; i++)x[i] = false;
	for (long long i = 2; i <= e; i++)
	{
		if (x[i]);
		else
		{
			Prime.push_back(i);
			for (long long l = i; l <= e; l += i)x[l] = true;
		}
	}
	return;
}
int StringToInt(string a)
{
	stringstream ss;
	int x;
	ss << a;
	ss >> x;
	return x;
}
string IntToString(int a)
{
	stringstream ss;
	string x;
	ss << a;
	ss >> x;
	return x;
}
int GetRandom(int MIN, int MAX)
{
	static int flag=0;
	if (flag == 0)
	{
		srand((unsigned int)time(NULL));
		flag = 1;
	}
	return MIN + (int)(rand()*(MAX - MIN + 1.0) / (1.0 + RAND_MAX));
}
int in()
{
	int x;
	cin >> x;
	return x;
}
void outl(string a)
{
	cout << a << endl;
	return;
}
void outl(int a)
{
	cout << a << endl;
	return;
}
void out(string a)
{
	cout << a;
	return;
}
void out(int a)
{
	cout << a;
	return;
}
/*
(char)'1' - (int)48 = (int)1;
???1111181
 (char)A=(int)65
 (char)a=(int)97
 */
////////////////////////////////////////////////////

int main()
{
	int n, m;
	while (cin >> n >> m&&n&&m)
	{
		vector<char> c;
		rep(i, n)c.push_back('#');
		rep(i, m)
		{
			char now;
			cin >> now;
			bool wan = false;
			bool ok = true;
			switch (now)
			{
			case 'A':
				for (int l = 0;l<c.size(); l++)
				{
					if (c[l] == '#')
					{
						c[l] = 'A';
						break;
					}

				}
				break;
			case'B':
				for (int l = c.size() - 1; l >= 0; l--)
				{
					if (c[l] == '#')
					{
						if (l - 1 == -1 || c[l - 1] != 'A')
						{
							if (l + 1 == c.size() || c[l + 1] != 'A')
							{
								ok = false;
								c[l] = 'B';
								break;
							}
						}
					}
				}
				if (ok)
				{
					for (int l = 0;l<c.size(); l++)
					{
						if (c[l] == '#')
						{
							c[l] = 'B';
							break;
						}
					}
				}
				break;
			case'C':
				for (int l = 0; l < c.size(); l++)
				{
					if (c[l] != '#')
					{
						if (l + 1 < c.size() && c[l + 1] == '#')
						{
							c[l + 1] = 'C';
							ok = false;
							break;
						}
						else if (l - 1 >= 0 && c[l - 1] == '#')
						{
							c[l - 1] = 'C';
							ok = false;
							break;
						}
					}
				}
				
				if (ok)
				{
					int j;
					if (c.size() % 2 == 1)
					{
						j = (c.size() + 1) / 2;
					}
					else
					{
						j = c.size() / 2 + 1;
					}
					j--;
					c[j] = 'C';
				}
				break;
			case'D':
				if (i == 0)
				{
					c[0] = 'D';
				}
				else
				{
					int ann = 0;
					int hhh = -1;
					for (int l = c.size() - 1; l >= 0; l--)
					{
						if (c[l] == '#')
						{
							int pp = 0;
							int PP = 0;
							for (int b = l; b >= 0; b--)
							{
								pp++;
								if (c[b] != '#')
								{
									break;
								}
								if (b == 0)pp = 999;
							}

							for (int b = l; b < c.size(); b++)
							{
								PP++;
								if (c[b] != '#')
								{
									break;
								}
								if (b == c.size()-1)PP = 999;
							}
							pp = min(pp, PP);
							if (pp >= ann)
							{
								ann = pp;
								hhh = l;
							}
						}
					}

					c[hhh] = 'D';

				}
				break;
			}
		}

		for (int i = 0; i < c.size(); i++)
		{
			cout << c[i];
		}
		cout << endl;

	}
}

C++: #include<bits/stdc++.h>
#define rep(i,n)for(int i=0;i<n;i++)
using namespace std;

char s[200], a[2];
int main() {
	bool b;
	int n, m;
	while (scanf("%d%d", &n, &m), n) {
		memset(s, 0, sizeof(s)); rep(i, n)s[i] = '#';
		rep(i, m) {
			scanf("%s", a);
			switch (a[0]) {
			case 'A':
				rep(i, n) { if (s[i] == '#') { s[i] = 'A'; break; } }
				break;
			case 'B':
				b = false;
				for (int i = n - 1; i >= 0; i--) {
					if (s[i] == '#' && (!i || s[i - 1] != 'A') && (i + 1 >= n || s[i + 1] != 'A')) {
						b = true; s[i] = 'B'; break;
					}
				}
				if (!b)rep(i, n) { if (s[i] == '#') { s[i] = 'B'; break; } }
				break;
			case 'C':
				b = false;
				rep(i, n) {
					if (s[i] != '#') {
						if (i + 1 < n&&s[i + 1] == '#') { s[i + 1] = 'C'; b = true; break; }
						if (i&&s[i - 1] == '#') { s[i - 1] == 'C'; b = true; break; }
					}
				}
				if (!b)s[n & 1 ? (n + 1) / 2 - 1 : n / 2] = 'C';
				break;
			case 'D':
				int k, Max = -1;
				rep(i, n) {
					if (s[i] != '#')continue;
					int cnt = INT_MAX;
					int t = i - 1;
					for (; t >= 0 && s[t] == '#'; t--);
					cnt = t == -1 ? INT_MAX : i - t;
					t = i + 1;
					for (; t < n&&s[t] == '#'; t++);
					cnt = min(cnt, t == n ? INT_MAX : t - i);
					if (Max < cnt) {
						k = i; Max = cnt;
					}
				}
				s[k] = 'D';
				break;
			}
		}
		printf("%s\n", s);
	}
}