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<iostream>
#define MAX_N 110
using namespace std;

char dx[MAX_N];
bool firstflag;
void reset();
void typeA(int n);
void typeB(int n);
void typeC(int n);
void typeD(int n);

int main(){
    int n, m;
    while(cin >>n >>m){
        if(n == 0 && m == 0) break;
        reset();
        firstflag = true;
        for(int i = 0; i < m; i++){
            char input;
            cin >>input;
            if(input == 'A') typeA(n);
            if(input == 'B') typeB(n);
            if(input == 'C') typeC(n);
            if(input == 'D') typeD(n);
            if(i == 0) firstflag = false;
        }
        for(int i = n - 1; i >= 0; i--){
            cout <<dx[i];
        }
        cout <<endl;
    }
    return 0;
}

void reset(){
    for(int i = 0; i < MAX_N; i++){
        dx[i] = '#';
    }
}

void typeA(int n){
    for(int i = n - 1; i >= 0; i--){
        if(dx[i] == '#'){
            dx[i] = 'A';
            break;
        }
    }
}

void typeB(int n){
    bool okflag = false;
    for(int i = 0; i < n; i++){
        if(dx[i] == '#'){
            if(i == 0){
                if(dx[i + 1] != 'A'){
                    dx[i] = 'B';
                    okflag = true;
                }
            } else if(i == n - 1){
                if(dx[i - 1] != 'A'){
                    dx[i] = 'B';
                    okflag = true;
                }
            } else{
                if(dx[i + 1] != 'A' && dx[i - 1] != 'A'){
                    dx[i] = 'B';
                    okflag = true;
                }
            }
        }
        if(okflag) break;
    }
    if(!okflag){
        for(int i = n - 1; i >= 0; i--){
            if(dx[i] == '#'){
                dx[i] = 'B';
                break;
            }
        }
    }
}

void typeC(int n){
    if(firstflag){
        if(n % 2 == 0){
            dx[n - (n / 2 + 1)] = 'C';
        } else{
            dx[n - ((n + 1) / 2)] = 'C';
        }
    } else{
        bool okflag = false;
        for(int i = n - 1; i >= 0; i--){
            if(i != 0){
                if(dx[i] !='#' && dx[i - 1] == '#'){
                    dx[i - 1] = 'C';
                    okflag = true;
                }
                if(okflag) break;
            }
            if(i != n - 1){
                if(dx[i] != '#' && dx[i + 1] == '#'){
                    dx[i + 1] = 'C';
                    okflag = true;
                }
                if(okflag) break;
            }
        }
    }
}

void typeD(int n){
    if(firstflag){
        dx[n - 1] = 'D';
    } else{
        int max = 0, maxi = 0, now = 0, f = 0;
        for(int i = 0; i < n; i++){
            if(dx[i] == '#'){
                now++;
            } else{
                if(f == 0) f++;
                else if(f == 1) f++;
                if(max <= now){
                    max = now;
                    maxi = i;
                }
                now = 0;
            }
        }
        //cout <<"max = " <<max <<"maxi = " <<maxi <<"f = " <<f <<endl;
        if(max <= now){
            //cout <<"!" <<endl;
            dx[n -  1] = 'D';
        } else if(f == 1){
            dx[0] = 'D';
        } else{
            int tmp = maxi - (max / 2);
            if(max % 2 == 1) tmp--;
            dx[tmp] = 'D';
        }
    }
}