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
		}
		chairs := make([]string, n)
		for i := range chairs {
			chairs[i] = "#"
		}
		sit := func(who string) {
			if who == "A" {
				chairs[getStringIndex(chairs, "#")] = "A" // A国の人は左から見て行って空いている席を見つけ次第座る
				// log.Println(chairs)
			} else if who == "B" {
				f := true
				for i := n-1; i > -1; i-- {
					// B国の人はA国人の隣以外で、右端から空いている椅子に座る
					if chairs[i] == "#" && (i == 0 || chairs[i-1] != "A") && (i == n-1 || chairs[i+1] != "A") {
								chairs[i] = "B"
								f = false
								break
					}
				}
				// A国人の隣しか空いていない場合、我慢して左端から空いている椅子に座る
				if f {
					chairs[getStringIndex(chairs, "#")] = "B"
				}
				// log.Println(chairs)
			} else if who == "C" { // C国人は人の隣に座りたい
				for i := 0; i < n; i++ {
					if chairs[i] != "#" {
						if i + 1 <= n-1 && chairs[i+1] == "#" {
							chairs[i+1] = "C"
							break
						} else if i - 1 >= 0 && chairs[i-1] == "#" {
							chairs[i-1] = "C"
							break
						}
					}
				}
				// log.Println(chairs)
			} else { // who == "D"
				// D国の人は人から離れて座りたい
				// どうしても誰かの隣に座らなければならない場合、その中で一番左側にある椅子に座る
				scores := make([]int, n)
				for i := range scores {
					scores[i] = INF
				}
				for i, v := range chairs {
					if v == "#" {
						scores[i]++
					}
				}
				for i := n-1; i > -1; i-- {
					tmp := 0
					if chairs[i] == "#" {
						tmp++
					} else {
						tmp = 0
					}
					scores[i] = min(scores[i], tmp)
				}
				chairs[getIntIndex(scores, getMax(scores))] = "D"
				// log.Println(chairs)
			}
		}
		scanner.Scan()
		if first := scanner.Text(); first == "A" || first == "D" {
			chairs[0] = first
		} else if first == "B" {
			chairs[len(chairs)-1] = "B"
		} else {
			chairs[n/2] = "C"
		}
		// log.Println(chairs)
		for i := 0; i < m-1; i++ {
			scanner.Scan()
			sit(scanner.Text())
		}
		fmt.Println(strings.Join(chairs, ""))
	}
}

func getStringIndex(chairs []string, who string) int {
	for i, v := range chairs {
		if v == who {
			return i
		}
	}
	return -1
}

func getIntIndex(scores []int, target int) int {
	for i, v := range scores {
		if v == target {
			return i
		}
	}
	return -1
}

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

func getMax(scores []int) int {
	tmp := -1
	for _, v := range scores {
		if tmp < v {
			tmp = v
		}
	}
	return tmp
}

C++: #include<bits/stdc++.h>

#define REP(i,s,n) for(int i=s;i<n;i++)
#define rep(i,n) REP(i,0,n)

using namespace std;

char tmp[200];

int main(){
  int n,m;
  while( cin >> n >> m, n|m ){
    rep(i,n) tmp[i] = '#';
    rep(_,m){
      char c;
      cin >> c;
      if( c == 'A' ){
        rep(i,n) if( tmp[i] == '#' ) {
          tmp[i] = c;
          break;
        }
      } else if( c == 'B' ) {
        bool ok = false;
        for(int i=n-1;i>=0;i--) if( tmp[i] == '#' ) {
          int res = 0;
          if( 0 <= i-1 ) res += (tmp[i-1]=='A');
          if( i+1 < n  ) res += (tmp[i+1]=='A');
          if( res ) continue;
          tmp[i] = c;
          ok = true;
          break;
        }
        if( !ok ) {
          rep(i,n) if( tmp[i] == '#' ) {
            tmp[i] = c;
            break;
          }
        }
      } else if( c == 'C' ) {
        bool failed = false;
        rep(i,n) if(tmp[i]!='#') {
          failed = true;
          break;
        }
        if( !failed ) {
          tmp[(n&1)?((n+1)/2):(n/2+1)] = c;
        } else {
          rep(i,n) if( tmp[i] != '#' ){
            if( i+1 < n && tmp[i+1] == '#' ){
              tmp[i+1] = c;
              break;
            }
            if( 0 <= i-1 && tmp[i-1] == '#' ){
              tmp[i-1] = c;
              break;
            }
          }
        }
      } else {
        bool flag = true;
        rep(i,n) if( tmp[i] != '#' ) {
          flag = false;
          break;
        }
        if( flag ){
          tmp[0] = c;
        } else {
          int pos = -1, maxi = -1;
          rep(i,n)if(tmp[i]=='#'){
            int cost = 0, x = i;          
            while( 0 <= x-1 ) {
              x--;
              if( tmp[x] != '#' ) break;
              cost++;
            }
            int cost2 = 0;
            x = i;
            while( x+1 < n ){
              x++;
              if( tmp[x] != '#' ) break;
              cost2++;
            }
            cost = min(cost,cost2);
            if( cost > maxi ){
              maxi = cost;
              pos = i;
            }
          }
          assert( pos != -1 );
          tmp[pos] = c;
        }
      }
    }
    rep(i,n) cout << tmp[i]; cout << endl;
  }
  return 0;
}