Go: package main

import (
	"bufio"
	"os"
	"strconv"
	"strings"
	"fmt"
)

var scanner = bufio.NewScanner(os.Stdin)

type Point struct {
	x, y int
}

func main() {
	dx := []int{1, 0, -1, 0}
	dy := []int{0, -1, 0, 1}
	maze := make([][]rune, 30)
	for i := range maze {
		maze[i] = make([]rune, 30)
	}
	next := make([][]rune, 30)
	for i := range next {
		next[i] = make([]rune, 30)
	}
	check := make([][]int, 30)
	for i := range check {
		check[i] = make([]int, 30)
	}
	for scanner.Scan() {
		buf := strings.Split(scanner.Text(), " ")
		W, _ := strconv.Atoi(buf[0])
		H, _ := strconv.Atoi(buf[1])
		if W == 0 && H == 0 {
			break
		}
		for i := 0; i < H; i++ {
			scanner.Scan()
			buf_ := scanner.Text()
			for j, v := range buf_ {
				maze[i][j] = v
			}
		}
		man := 0
		for i := 0; i < H; i++ {
			for j := 0; j < H; j++ {
				if maze[i][j] != '.' && maze[i][j] != 'X' && maze[i][j] != '#' {
					switch maze[i][j] {
					case 'E':
						maze[i][j] = 0
						man++
					case 'N':
						maze[i][j] = 1
						man++
					case 'W':
						maze[i][j] = 2
						man++
					case 'S':
						maze[i][j] = 3
						man++
					}
				}
			}
		}
		ans := -1
		for t := 0; t <= 180; t++ {
			if man == 0 {
				ans = t
				break
			}
			for i := 0; i < H; i++ {
				for j := 0; j < W; j++ {
					check[i][j] = 0x7FFFFFFF
				}
			}
			for i := 0; i < H; i++ {
				for j := 0; j < W; j++ {
					if maze[i][j] > 3 {
						continue
					}
					l := (maze[i][j] + 3) % 4
					for k := 0; k < 4; k++ {
						y := i + dy[l]
						x := j + dx[l]
						if 0 <= y && y < H && 0 <= x && x < W && (maze[y][x] == '.' || maze[y][x] == 'X') {
							maze[i][j] = l
							check[y][x] = min(check[y][x], int((l+2)%4))
							break
						}
						l = (l + 1) % 4
					}
				}
			}
			for i := 0; i < H; i++ {
				for j := 0; j < W; j++ {
					next[i][j] = maze[i][j]
				}
			}
			for i := 0; i < H; i++ {
				for j := 0; j < W; j++ {
					if maze[i][j] > 3 {
						continue
					}
					y := i + dy[maze[i][j]]
					x := j + dx[maze[i][j]]
					if 0 <= y && y < H && 0 <= x && x < W && check[y][x] == int((maze[i][j]+2)%4) {
						if maze[y][x] == '.' {
							next[y][x] = maze[i][j]
						} else if maze[y][x] == 'X' {
							man--
						}
						next[i][j] = '.'
					}
				}
			}
			for i := 0; i < H; i++ {
				for j := 0; j < W; j++ {
					maze[i][j]=next[i][j]
				}
			}
		}
		if ^ans != 0 {
			fmt.Println(ans)
		} else {
			fmt.Println("NA")
		}
	}
}

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

C++: #include <iostream>
#include <map>
#include <cstdlib>
#include <algorithm>
#include <string>

using namespace std;

int h, w;

char data[30][30];
char next[30][30];
int dy[] = {0, -1, 0, 1};
int dx[] = {1, 0, -1, 0};
map<char, int> ctoi;
string itoc = "ENWS";

void copy(){
   for(int i=0;i<h;++i){
      for(int j=0;j<w;++j){
         data[i][j] = next[i][j];
      }
   }
}

main(){
   ctoi['E'] = 0;
   ctoi['N'] = 1;
   ctoi['W'] = 2;
   ctoi['S'] = 3;
   while(cin >> w >> h && (h || w)){
      int p = 0;
      for(int i=0;i<h;++i){
         for(int j=0;j<w;++j){
            cin >> next[i][j];
            if(next[i][j] == 'E' ||
               next[i][j] == 'N' ||
               next[i][j] == 'W' ||
               next[i][j] == 'S') ++p;
         }
      }
      copy();
      int t;
      for(t=0;t<=180;++t){
         if(p == 0) break;
         for(int i=0;i<h;++i){
            for(int j=0;j<w;++j){
               if(data[i][j] == '#' ||
                  data[i][j] == '.' ||
                  data[i][j] == 'X') continue;
               for(int k=0;k<4;++k){
                  int d = (ctoi[data[i][j]] + 3 + k) % 4;
                  int ty = i + dy[d];
                  int tx = j + dx[d];
                  if(ty<0 || ty>=h) continue;
                  if(tx<0 || tx>=w) continue;
                  if(data[ty][tx] == '.' || data[ty][tx] == 'X'){
                     data[i][j] = itoc[d];
                     break;
                  }
               }
            }
         }
         for(int i=0;i<h;++i){
            for(int j=0;j<w;++j){
               if(data[i][j] == '.' || data[i][j] == 'X'){
                  for(int k=0;k<4;++k){
                     int ty = i + dy[k];
                     int tx = j + dx[k];
                     if(ty<0 || ty>=h) continue;
                     if(tx<0 || tx>=w) continue;
                     if(data[ty][tx] == '#' ||
                        data[ty][tx] == '.' ||
                        data[ty][tx] == 'X') continue;
                     if(abs(ctoi[data[ty][tx]] - k) == 2){
                        if(data[i][j] == 'X') --p;
                        else next[i][j] = data[ty][tx];
                        next[ty][tx] = '.';
                        break;
                     }
                  }
               }
            }
         }
         copy();
      }
      if(t > 180) cout << "NA" << endl;
      else cout << t << endl;
   }
   return 0;
}

C++: #include <iostream>
using namespace std;
#define rep(i,n) for(int i = 0 ; i < n ; i++) 

int dx[] = {1,0,-1,0};
int dy[] = {0,-1,0,1};
string dd = "ENWS";
int main(){
	int H,W;
	while(cin >> W >> H && W){
		char c[31][31]={},C[31][31]={};
		for(int i = 0 ; i < H ; i++)
			for(int j = 0 ; j < W ; j++)
				cin >> c[i][j];
		int sec = 0 , ok = 0;
		while(sec <= 180){
			int endok = 1;
			rep(i,H)rep(j,W) if(c[i][j] == 'E' || c[i][j] == 'S' || c[i][j] == 'W' || c[i][j] == 'N') endok = 0;
			if(endok){
				cout << sec << endl;
				ok = true;
				break;
			}
			pair<int,int> next[31][31];
			int done[31][31] = {};
			
			rep(i,31)rep(j,31) next[i][j] = make_pair(-1,-1);
			rep(i,H)rep(j,W) C[i][j] = c[i][j];
			rep(i,31)rep(j,31) if(C[i][j] == 'E' || C[i][j] == 'S' || C[i][j] == 'W' || C[i][j] == 'N') C[i][j] = '.';
			
			rep(i,H)rep(j,W) {
				if(c[i][j] == 'E' || c[i][j] == 'S' || c[i][j] == 'W' || c[i][j] == 'N'){
					int b = (dd.find(c[i][j]) + 3)%4;
					int f = 1;
					rep(d,4){
						int nx = j + dx[(b+d)%4];
						int ny = i + dy[(b+d)%4];
						if(c[ny][nx] == '.' || c[ny][nx] == 'X'){
							next[i][j]= make_pair(nx,ny);
							f = 0;
							break;
						}
					}
					if( f) C[i][j] = c[i][j];
				}
			}
			rep(i,H)rep(j,W) {
				if( c[i][j] == '.' || c[i][j] == 'X'){
					rep(d,4){
						int nx = j + dx[d];
						int ny = i + dy[d];
						if( (c[ny][nx] == 'E' || c[ny][nx] == 'S' || c[ny][nx] == 'W' || c[ny][nx] == 'N') && next[ny][nx] == make_pair(j,i)){
							if(done[i][j]){
								C[ny][nx] = dd[(d + 2)%4]; 
							}else{
								if( c[i][j] == '.' ) {
									//if( sec < 10 ) cout << c[ny][nx] << " " << endl;
									C[i][j] = dd[(d + 2)%4]; 
									done[i][j] = true;
								}else{
									done[i][j] = true;
								}
							}
						}
					}
				}
			}
			//if(sec < 10){ rep(i,H) cout << C[i] << endl;cout << endl;}
			rep(i,H)rep(j,W) c[i][j] = C[i][j];
			sec++;
		}
		if(!ok) cout << "NA" << endl;
	}
}