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 // 次の人を読み込む
			}
		}
		for i := 0; i < n; i++ {
			if i == n-1 {
				fmt.Println(chair[i])
			} else {
				fmt.Printf("%s ", chair[i])
			}
		}
	}
}

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++: #include <stdio.h>
#include <cmath>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>

using namespace std;

struct Info{
	Info(){
		country = '#';
	}
	char country;
};

void func(int n,int m){
	Info info[n];
	char tmp[2];
	int maximum,most_left_index,pre_index,div,left_dist;
	bool FLG;

	for(int loop = 0; loop < m; loop++){
		scanf("%s",tmp);

		switch(tmp[0]){
		case 'A':
			for(int i = 0; i < n; i++){
				if(info[i].country == '#'){
					info[i].country = 'A';
					break;
				}
			}
			break;
		case 'B':
			FLG = false;

			if(info[n-1].country == '#' && info[n-2].country != 'A'){
				info[n-1].country = 'B';
				break;
			}

			for(int i = n-2; i >= 1; i--){
				if(info[i].country == '#' && info[i-1].country != 'A' && info[i+1].country != 'A'){
					info[i].country = 'B';
					FLG = true;
					break;
				}
			}

			if(FLG)break;

			if(info[0].country == '#' && info[1].country != 'A'){
				info[0].country = 'B';
				break;
			}

			for(int i = 0; i < n; i++){
				if(info[i].country == '#'){
					info[i].country = 'B';
					break;
				}
			}
			break;
		case 'C':
			if(loop == 0){
				if(n%2 == 1){
					info[(n+1)/2].country = 'C';
				}else{
					info[(n/2)+1].country = 'C';
				}
			}else{
				FLG = false;
				if(info[0].country != '#' && info[1].country == '#'){
					info[1].country = 'C';
					break;
				}
				for(int i = 1; i <= n-2; i++){
					if(info[i].country != '#'){
						if(info[i+1].country == '#'){
							info[i+1].country = 'C';
							FLG = true;
							break;
						}else if(info[i-1].country == '#'){
							info[i-1].country = 'C';
							FLG = true;
							break;
						}
					}
					if(FLG)break;
				}
				if(FLG)break;

				if(info[n-1].country != '#' && info[n-2].country == '#'){
					info[n-2].country = 'C';
					break;
				}
			}
			break;
		case 'D':

			if(loop == 0){
				info[0].country = 'D';
			}else{
				maximum = 0;
				most_left_index = -1;
				pre_index = -1;

				if(info[0].country == '#'){
					most_left_index = 0;
					for(div = 1; div <= n-1; div++){
						if(info[div].country != '#'){
							break;
						}
					}
					maximum = div;
				}else{
					pre_index = 0;
				}

				for(int i = 1; i <= n-1; i++){
					if(info[i].country == '#'){

						left_dist = i - pre_index;

						if(i <= n-2){
							for(div = 1; i+div <= n-1; div++){
								if(info[i+div].country != '#'){
									break;
								}
							}
						}else{ //i == n-1
							div = left_dist;
						}

						div = min(left_dist,div);

						if(div > maximum){
							maximum = div;
							most_left_index = i;
						}
					}else{
						pre_index = i;
					}
				}

				info[most_left_index].country = 'D';
			}

			break;
		}
	}

	for(int i = 0; i < n; i++)printf("%c",info[i].country);
	printf("\n");
}

int main(){

	int n,m;
	while(true){
		scanf("%d %d",&n,&m);
		if(n == 0 && m == 0)break;

		func(n,m);

	}

    return 0;
}

C++: 
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<string>
#include<queue>
#include<vector>
#include<functional>
#include<cmath>
#include<map>
#include<stack>
#include<set>
#include<numeric>
#include<limits>

#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()

using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ll, char> plc;

int main()
{
	int m, n;
	while (cin >> n >> m, n, m) 
	{
		int a[110] = { 0 };
		for (int i = 0; i < m; i++) 
		{
			char c; cin >> c;
			if (c == 'A') 
			{
				for (int j = 0; j < n; j++)if (!a[j]) { a[j] = 1; break; }
			}
			if (c == 'B') 
			{
				for (int j = n - 1; j >= 0; j--)if (!a[j]) { a[j] = 2; break; }
			}
			if(c == 'C')
			{
				if (!i)a[n / 2] = 3;
				else
				{
					for (int j = 0; j < n; j++) 
					{
						if (j != n - 1 && a[j] && !a[j + 1]) { a[j + 1] = 3; break; }
						if (j && a[j] && !a[j - 1]) { a[j - 1] = 3; break; }
					}
				}
			}
			if (c == 'D') 
			{
				if (!i)a[0] = 4;
				else
				{
					int mc = -1, mi = -1, x, y;
					for (int j = 0; j < n; j++) 
					{
						x = y = 999;
						for (int k = j; k >= 0; k--)if (a[k]) { x = j - k; break; }
						for (int k = j; k < n; k++)if (a[k]) { y = k - j; break; }
						if (x > y)x = y;
						if (mc < x)mc = x, mi = j;
					}
					a[mi] = 4;
				}
			}
		}
		for (int j = 0; j < n; j++)putchar("#ABCD"[a[j]]);
		puts("");
	}
	return 0;
}