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, ""))
	}
}

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<iostream>

char *chr, *peo;
int n,m;

void sitA(int i){
	for(int k=0; k<n; k++){
		if(chr[k] == '#'){
			chr[k] = 'A';
				break;
		}
	}
	return;
}

void sitB(int i){
	if(chr[n-1]=='#' && chr[n-2] != 'A'){
		chr[n-1] = 'B';
		return;
	}
	for(int k=n-2; k>0; k--){
		if(chr[k] == '#' && chr[k-1] != 'A' && chr[k+1] != 'A'){
			chr[k] = 'B';
			return;
		}
	}
	if(chr[0]=='#' && chr[1] != 'A'){
		chr[0] = 'B';
		return;
	}	
	for(int k=0; k<n; k++){
		if(chr[k] == '#'){
			chr[k] = 'B';
			return;
		}
	}
}

void sitC(int i){
	if(i==0){
		if(n%2 == 0)
			chr[(n/2)+1] = 'C';
		else
			chr[(n+1)/2] = 'C';
		return;
	}
	for(int k=0; k<n; k++){
		if(chr[k] == '#')
			continue;
		if(k>0){
			if(chr[k-1] == '#'){
				chr[k-1] = 'C';
				return;
			}
		}
		if(k<n-1){
			if(chr[k+1] == '#'){
				chr[k+1] = 'C';
				return;
			}
		}
	}
}

void sitD(int i){
	if(i==0){
		chr[0] = 'D';
		return;
	}
	int ans,tmp=0,tmp1,tmp2;
	for(int k=0; k<n; k++){
		if(chr[k] == '#'){
			ans = k;
			break;
		}
	}
	for(int k=ans; k<n; k++){
		if(chr[k] != '#')
			continue;
		tmp1=0;
		tmp2=0;
		if(k<n-1){
			for(int t=k+1; t<n; t++){
				if(chr[t] != '#')
					break;
				tmp1++;
			}
		}
		if(k>0){
			for(int t=k-1; t>=0; t--){
				if(chr[t] != '#')
					break;
				tmp2++;
			}
		}
		if(tmp1 > tmp2)
			tmp1 = tmp2;
		if(tmp1 > tmp){
			tmp = tmp1;
			ans = k;
		}
	}
	chr[ans] = 'D';
}

void solve(){
	char tmp;
	for(int i=0; i<m; i++){
		tmp = peo[i];
		switch(tmp){
		case 'a':
		case 'A':
			sitA(i);
			break;
		case 'b':
		case 'B':
			sitB(i);
			break;
		case 'c':
		case 'C':
			sitC(i);
			break;
		case 'd':
		case 'D':
			sitD(i);
			break;
		}
	}
	std::cout << chr << std::endl;
}

int main(){
	while(true){
		std::cin >> n >> m;
		if(!n && !m)
			return 0;
		chr = new char[n];
		peo = new char[m];
		for(int i=0; i<n; i++){
			chr[i] = '#';
			if(i>=m)
				chr[i] = '#';
			else
				std::cin >> peo[i];
		}
		solve();
		delete[] chr;
		delete[] peo;
	}
}

C++: #include <iostream>
#include <cstring>
#include <algorithm>

using namespace std;

int chair[100],pos,n,m;

int d(char c){
	if(c == 'A'){
		for(int i=0;i<n;i++){
			if(chair[i] == -1) return i;
		}
	}else if(c == 'B'){
		for(int i=n-1;i>=0;i--){
			if(chair[i] == -1){
				if(i == 0){
					if(chair[i+1] != 'A') return i;
				}else if(i == n-1){
					if(chair[i-1] != 'A') return i;
				}else{
					if(chair[i-1] != 'A' && chair[i+1] != 'A') return i;
				}
			}
		}
		for(int i=0;i<n;i++){
			if(chair[i] == -1) return i;
		}
	}else if(c == 'C'){
		for(int i=0;i<n;i++){
			if(chair[i] != -1){
				if(i+1 < n && chair[i+1] == -1) return i+1;
				if(0 <= i-1 && chair[i-1] == -1) return i-1;
			}
		}
		return n/2;
	}else{
		int d_min_max = 0,d_pos=-1,tmp;
		for(int i=0;i<n;i++){
			//ó¢Ä¢éÖqÆÅàß¢lÌ£ðßé
			
			if(chair[i] == -1){
				int dist_min = 1 << 28;
				if(i != n-1){
					tmp = 1;
					while(i+tmp < n && chair[i+tmp] == -1) tmp++;
					if(i+tmp<n){
						dist_min = min(dist_min, tmp);
					}
				}
				if(i != 0){
					tmp = 1;
					while(i-tmp >= 0 && chair[i-tmp] == -1) tmp++;
					if(i-tmp >= 0){
						dist_min = min(dist_min, tmp);
					}
				}
				if(d_min_max < dist_min && dist_min != 1 << 28){
					d_min_max = dist_min;
					d_pos = i;
				}
			}
		}
		if(d_pos != -1) return d_pos;
		for(int i=0;i<n;i++){
			if(chair[i] == -1) return i;
		}
	}
}

int main(){
	while(cin >> n >> m){
		if(!(n|m)) break;
		char c;
		memset(chair, -1, sizeof(chair));
		for(int i=0;i<m;i++){
			cin >> c;
			chair[d(c)] = c;
		}
		for(int i=0;i<n;i++){
			if(chair[i] == -1){
				cout << "#";
			}else{
				cout << (char)chair[i];
			}
		cout << endl;
		}
	}
}

C++: #include<bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define rep(i,n) REP((i),0,(n))
#define RREP(i,a,b) for(int i=(int)(a);i>=(int)(b);i--)
#define rrep(i,n) RREP(i,n,0)
#define each(it,X) for(__typeof((X).begin())  it=(X).begin();it!=(X).end();it++)
#define all(v) ((v).begin(),(v).end())
#define fi first
#define se second
#define pb push_back
typedef pair<int,int>pr;
typedef vector<int>vi;
typedef vector<vi>vvi;
typedef set<int>si;
const int INF=1070000000ll;
const int mod=1000000007ll;

int n,m;
char seet[100];
void A(){
    rep(i,n)if(seet[i]=='#'){
        seet[i]='A';
        return;
    }
}
void B(){
    rrep(i,n-1)if(seet[i]=='#'){
        if((i!=0||seet[i-1]!='A')&&(i!=n-1||seet[i+1]!='A')){
            seet[i]='B';
            return;
        }
    }
    rrep(i,n-1)if(seet[i]=='#'){
        seet[i]='B';
        return;
    }
}
void C(){
    rep(i,n)if(seet[i]=='#'){
        if((i!=0&&seet[i-1]!='#')||(i!=n-1&&seet[i+1]!='#')){
            seet[i]='C';
            return;
        }
    }
    seet[n/2]='C';
}
void D(){
    int ma=0,dist=0;
    rep(i,n)if(seet[i]=='#'){
        int v=1000;
        rep(j,n)if(seet[j]!='#'){
            v=min(abs(i-j),v);
        }
        if(dist<v){
            dist=v;
            ma=i;
        }
    }
    seet[ma]='D';
}
signed main(){
    cin.tie(0);ios_base::sync_with_stdio(0);

    while(cin>>n>>m,n||m){
        fill_n(seet,n,'#');
        rep(i,m){
            char c;cin>>c;
            switch(c){
                case 'A':A();break;
                case 'B':B();break;
                case 'C':C();break;
                case 'D':D();break;
            }
        }
        rep(i,n)cout<<seet[i];cout<<endl;
    }
    return 0;
}