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 <bits/stdc++.h>
using namespace std;
int n,m;
char chair[200]={};

void A(char ch){
  int i=1;
  while(chair[i]!='#') i++;
  chair[i]=ch;
}

void B(){
  int i=n;
  while(chair[i]!='#')i--;
  chair[i]='B';
}

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

void D(int kai){
  int R=0,L=0;
  while(chair[n-R]=='#')R++;
  while(chair[L+1]=='#') L++;
  
  int M=0,idx=0,cnt=0;
  for(int i=1;i<=n;i++){
    if(chair[i]=='#')cnt++;
    else cnt=0;
    if(M+M%2<cnt) M=cnt,idx=i;
  }
  if(M<=2&&L<=1&&R<=1) {
    A('D');
    return;
  }
   if(L-1>=(M-1)/2&&L-1>=R-1)chair[1]='D';
  else if(R-1>=(M-1)/2)chair[n]='D';
  else chair[(idx-M+1)+(M-1)/2]='D';

}

int main(){
  while(1){
    cin>>n>>m;
    if(!n&&!m)break;
    memset(chair,'#',sizeof(chair));
    chair[0]=chair[n+1]=0;
    for(int i=0;i<m;i++){
      char a;
      cin>>a;
      if(a=='A') A(a);
      if(a=='B') B();
      if(a=='C') C(i);
      if(a=='D') D(i);
    }
    assert(chair[n+1]==0);
    printf("%s\n",chair+1);
  }
  return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
int n,m;
char chair[200];

void A(char ch){
  int i=1;
  while(chair[i]!='#') i++;
  chair[i]=ch;
}

void B(){
  int i=n;
  while(chair[i]!='#')i--;
  chair[i]='B';
}

void C(int kai){
  if(kai==0){
    if(n%2)chair[(n+1)/2]='C';
    else chair[n/2+1]='C';
    return;
  }
  int f=1;
  for(int i=1;i<=n;i++){
    if(chair[i]=='#')continue;
    if(chair[i-1]=='#') chair[i-1]='C',i=n,f=0;
    else if(chair[i+1]=='#') chair[i+1]='C',i=n,f=0;
  }
  // assert(f);
}

void D(){
  int R=0,L=0;
  while(chair[n-R]=='#')R++;
  while(chair[L+1]=='#')L++;
  
  int M=0,idx=0,cnt=0;
  for(int i=1;i<=n;i++){
    if(chair[i]=='#')cnt++;
    else cnt=0;
    if(M+M%2<cnt) M=cnt,idx=i;
  }
  if(M<=2&&L<=1&&R<=1) A('D');
  else if(L-1>=(M-1)/2&&L-1>=R-1)chair[1]='D';
  else if(R-1>(M-1)/2)chair[n]='D';
  else chair[(idx-M+1)+(M-1)/2]='D';

}

int main(){
  while(1){
    cin>>n>>m;
    if(!n&&!m)break;
    memset(chair,'#',sizeof(chair));
    chair[0]=chair[n+1]=0;
    for(int i=0;i<m;i++){
      char a;
      cin>>a;
      if(a=='A') A(a);
      if(a=='B') B();
      if(a=='C') C(i);
      if(a=='D') D();
    }
    assert(strlen(chair+1)==n);
    printf("%s\n",chair+1);
  }
  return 0;
}

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

C++: #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<utility>
#include<cmath>
#include<cstring>
#include<queue>
#include<cstdio>
#include<sstream>
#define loop(i,a,b) for(int i=a;i<b;i++) 
#define rep(i,a) loop(i,0,a)
#define pb push_back
#define mp make_pair
#define all(in) in.begin(),in.end()
const double PI=acos(-1);
const double EPS=1e-10;
const int inf=1e8;
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pii;
int main(){
	int n,m;
	while(cin>>n>>m,n){
		vector<string>in(n,"");
		rep(q,m){
			string s;cin>>s;
			if(s=="A"){
				rep(i,n)if(in[i]==""){
					in[i]="A";
					break;
				}
			}else if(s=="B"){
				vector<string>tmp=in;
				rep(i,n)if(in[i]=="A"){
					if(i)tmp[i-1]="!";
					if(i!=n-1)tmp[i+1]="!";
				}
				int I=inf;
				for(int i=n-1;i>=0;i--)if(tmp[i]==""){I=i;break;}
				if(I==inf){
					rep(i,n)if(in[i]==""){
						I=i;
						break;
					}
				}
				in[I]="B";
			}else if(s=="C"){
				int I=inf;
				rep(i,n)if(in[i]==""){
					if((i&&in[i-1]!="")||(i!=n-1&&in[i+1]!="")){
						I=i;
						break;
					}
				}
				if(I==inf)I=n/2;
				in[I]="C";
			}else{
				if(!q){
					in[0]="D";
					continue;
				}
				vi t;
				rep(i,n)if(in[i]!="")t.pb(i);
				int ma=-1,mai=0;
				if(t[0]!=0){ma=t[0];mai=0;}
				rep(i,t.size()-1)if(t[i+1]-t[i]>1){
					if(ma<(t[i+1]-t[i])/2){
						ma=(t[i+1]-t[i])/2;
						mai=t[i]+(t[i+1]-t[i])/2;
					}
				}
				if(t[t.size()-1]!=n-1&&ma<n-t[t.size()-1]-1){
					mai=n-1;
				}
				in[mai]="D";
			}
		}
		rep(i,n)cout<<(in[i]==""?"#":in[i]);
		cout<<endl;
	}
}