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++: #include <iostream>
#include <set>
#include <vector>
#include <string>
#include <utility>
#include <algorithm>
#include <stdio.h>
using namespace std;
typedef pair<int,int> P;
int chair[110];
int n,m;
void A(){
	int ans=0;
	while(chair[ans]!=0)ans++;
	chair[ans]=1;
	return;
}
void B(){
	for(int i=n-1;i>=0;i--){
		if(chair[i]==0){
			if(i==0&&chair[1]!=1){chair[0]=2;return;}
			else if(i==n-1&&chair[n-2]!=1){chair[n-1]=2;return;}
			else if(0<i&&i<n-1&&chair[i-1]!=1&&chair[i+1]!=1){chair[i]=2;return;}
		}
	}
	int ans=0;
	while(chair[ans]!=0)ans++;
	chair[ans]=2;
	return;
}
void C(){
	int ans=0;
	if(chair[0]!=0){
		while(chair[ans]!=0)ans++;
		chair[ans]=3;
		return;
	}
	chair[n]=5;
	for(int i=0;i<n;i++){
		if(chair[i]!=0){
			if(chair[i+1]==0)chair[i+1]=3;
			else chair[i-1]=3;
			return;
		}
	}
	if(n%2)chair[(n+1)/2-1]=3;
	else chair[n/2]=3;
	return;
}
void D(){
	int a=0,f=0;
	P bl[52];
	//printf("chair:");for(int i=0;i<n;i++)printf("%d ",chair[i]);
	bool in=false;
	for(int i=0;i<=n;i++){
		if(in&&chair[i]!=0){
			in=false;bl[a++]=P(f,i);
		}else if(!in&&chair[i]==0){
			in=true;f=i;
		}
	}
	//for(int i=0;i<a;i++)printf("bl[%d]:[%d,%d)\n",i,bl[i].first,bl[i].second);
	if(bl[0].first==0&&bl[0].second==n){
		chair[0]=4;return;
	}else{
		int m,mlen=-1;
		for(int i=0;i<a;i++){
			int dis=(bl[i].second-bl[i].first-1)/2;
			if(bl[i].second==n)dis=bl[i].second-bl[i].first-1;
			if(dis>mlen){
				mlen=dis;m=i;
			}
		}
		//printf("%d+%d[%d]\n",bl[m].first,mlen,a);
		chair[(bl[m].first+mlen)%n]=4;return;
	}
}
int main()
{
	while(cin>>n>>m&&(n||m)){
		fill(chair,chair+n,0);
		chair[n]=5;
		while(m--){
			char c;cin>>c;
			if(c=='A')A();
			if(c=='B')B();
			if(c=='C')C();
			if(c=='D')D();
		}
		for(int i=0;i<n;i++){
			if(chair[i]==0)cout<<'#';
			if(chair[i]==1)cout<<'A';
			if(chair[i]==2)cout<<'B';
			if(chair[i]==3)cout<<'C';
			if(chair[i]==4)cout<<'D';
		}
		cout<<endl;
	}
    return 0;
}

C++: #include<iostream>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<utility>
#include<vector>
#include<cmath>
#include<cstdio>
#define loop(i,a,b) for(int i=a;i<b;i++) 
#define rep(i,a) loop(i,0,a)
#define REP(a) while(a--)
#define pb push_back
#define mp make_pair
#define it ::iterator
#define all(in) in.begin(),in.end()
const double PI=acos(-1);
const double ESP=1e-10;
using namespace std;
int main(){
  int in1,in2;
  while(cin>>in1>>in2,in1,in2){
    vector<char>in(in1+2,'\0');
    REP(in2){
      string s;
      cin>>s;
      if(s=="A"){
	rep(i,in1){
	  if(in[i+1]=='\0'){
	    in[i+1]='A';break;
	  }
	}
      }else if(s=="B"){
	bool han=false;
	for(int i=in1-1;i>=0;i--){
	  if(in[i+1]=='\0'&&in[i]!='A'&&in[i+2]!='A'){
	    han=true;in[i+1]='B';break;
	  }
	}
	if(!han)rep(i,in1)if(in[i+1]=='\0')in[i+1]='B';
      }else if(s=="C"){
	bool han=false;
	rep(i,in1)if(in[i+1]!='\0')han=true;
	if(!han){
	  if(in1%2)in[(in1+1)/2]='C';
	  else in[in1/2+1]='C';
	}else{
	  rep(i,in1)if(in[i+1]!='\0'){
	    bool ha=false;
	    rep(j,in1){
	      if(in[i+j+2]=='\0'){
		in[i+j+2]='C';
		ha=true;
		break;
	      }
	    }
	    if(ha)break;
	  }
	}
      }else if(s=="D"){
	int ans=0,ans2=0;
	vector<int>tmp;
	rep(i,in1)if(in[i+1]!='\0')tmp.pb(i+1);
	sort(all(tmp));
	if(tmp.size()==0)in[1]='D';
	else{
	  rep(i,in1)if(in[i+1]=='\0'){
	    int sa=99999;
	    rep(j,tmp.size())sa=min(sa,abs(i+1-tmp[j]));
	    if(ans<sa){ans=sa;ans2=i+1;}
	  }
	  in[ans2]='D';
	}
      }else 
    	cout<<"Error"<<endl;
    }
    rep(i,in1)
      if(in[i+1]=='\0')cout<<'#';
      else cout<<in[i+1];
    cout<<endl;
  }
}

C++: #include <iostream>
#include <set>
#include <vector>
#include <string>
#include <utility>
#include <algorithm>
#include <stdio.h>
using namespace std;
typedef pair<int,int> P;
int chair[110];
int n,m;
void A(){
	int ans=0;
	while(chair[ans]!=0)ans++;
	chair[ans]=1;
	return;
}
void B(){
	for(int i=n-1;i>=0;i--){
		if(chair[i]==0){
			if(i==0&&chair[1]!=1){chair[0]=2;return;}
			else if(i==n-1&&chair[n-2]!=1){chair[n-1]=2;return;}
			else if(0<i&&i<n-1&&chair[i-1]!=1&&chair[i+1]!=1){chair[i]=2;return;}
		}
	}
	int ans=0;
	while(chair[ans]!=0)ans++;
	chair[ans]=2;
	return;
}
void C(){
	int ans=0;
	if(chair[0]!=0){
		while(chair[ans]!=0)ans++;
		chair[ans]=3;
		return;
	}
	chair[n]=5;
	for(int i=0;i<n;i++){
		if(chair[i]!=0){
			if(chair[i+1]==0)chair[i+1]=3;
			else chair[i-1]=3;
			return;
		}
	}
	if(n%2)chair[(n+1)/2-1]=3;
	else chair[n/2]=3;
	return;
}
void D(){
	int a=0,f=0;
	P bl[52];
	//printf("chair:");for(int i=0;i<n;i++)printf("%d ",chair[i]);
	bool in=false;
	for(int i=0;i<=n;i++){
		if(in&&chair[i]!=0){
			in=false;bl[a++]=P(f,i);
		}else if(!in&&chair[i]==0){
			in=true;f=i;
		}
	}
	//for(int i=0;i<a;i++)printf("bl[%d]:[%d,%d)\n",i,bl[i].first,bl[i].second);
	if(bl[0].first==0&&bl[0].second==n){
		chair[0]=4;return;
	}else{
		int m,mlen=-1;
		for(int i=0;i<a;i++){
			int dis=(bl[i].second-bl[i].first-1)/2;
			if(bl[i].second==n)dis=bl[i].second-bl[i].first-1;
			if(dis>mlen){mlen=dis;m=i;}
		}
		//printf("%d+%d[%d]\n",bl[m].first,mlen,a);
		chair[bl[m].first+mlen]=4;return;
	}
}
int main()
{
	while(cin>>n>>m&&(n||m)){
		fill(chair,chair+n,0);
		chair[n]=5;
		while(m--){
			char c;cin>>c;
			if(c=='A')A();
			if(c=='B')B();
			if(c=='C')C();
			if(c=='D')D();
		}
		for(int i=0;i<n;i++){
			if(chair[i]==0)cout<<'#';
			if(chair[i]==1)cout<<'A';
			if(chair[i]==2)cout<<'B';
			if(chair[i]==3)cout<<'C';
			if(chair[i]==4)cout<<'D';
		}
		cout<<endl;
	}
    return 0;
}