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;

const int N = 30;

int h, w, t, p;
char data[N][N], next[N][N];
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)){
      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;
         }
      }
      if(p == 0){
         cout << "NA" << endl;
         continue;
      }
      copy();
      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<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<cassert>
#include<iostream>
#include<sstream>
#include<string>
#include<vector>
#include<queue>
#include<set>
#include<map>
#include<utility>
#include<numeric>
#include<algorithm>
#include<bitset>
#include<complex>
#include<stack>

using namespace std;

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

string str[40];
int w,h;

bool check(){
	rep(i,h)rep(j,w){
		if(str[i][j]=='#')continue;
		if(str[i][j]=='X')continue;
		if(str[i][j]=='.')continue;
		return false;
	}
	return true;
}

bool inside(int x,int y){
	return 0<=x&&x<w&&0<=y&&y<h;
}

void ch(){
	int dx[]={1,0,-1,0,1,0,-1,0};
	int dy[]={0,-1,0,1,0,-1,0,1};
	char dir[]={'E','N','W','S','E','N','W','S'};
	rep(i,h)rep(j,w){
		if(str[i][j]=='N'){
			for(int k=0;k<4;++k){
				if(!inside(j+dx[k],i+dy[k]))continue;
				if(str[i+dy[k]][j+dx[k]]=='.'||str[i+dy[k]][j+dx[k]]=='X'){
					str[i][j]=dir[k];
					break;
				}
			}
		}else if(str[i][j]=='W'){
			for(int k=1;k<5;++k){
				if(!inside(j+dx[k],i+dy[k]))continue;
				if(str[i+dy[k]][j+dx[k]]=='.'||str[i+dy[k]][j+dx[k]]=='X'){
					str[i][j]=dir[k];
					break;
				}
			}
		}else if(str[i][j]=='S'){
			for(int k=2;k<6;++k){
				if(!inside(j+dx[k],i+dy[k]))continue;
				if(str[i+dy[k]][j+dx[k]]=='.'||str[i+dy[k]][j+dx[k]]=='X'){
					str[i][j]=dir[k];
					break;
				}
			}
		}else if(str[i][j]=='E'){
			for(int k=3;k<7;++k){
//cout<<str[i+dy[k]][j+dx[k]]<<endl;
				if(!inside(j+dx[k],i+dy[k]))continue;
				if(str[i+dy[k]][j+dx[k]]=='.'||str[i+dy[k]][j+dx[k]]=='X'){
					str[i][j]=dir[k];
					break;
				}
			}
		}
	}
}

void mv(){
	string next[40];
	rep(i,40)next[i]=str[i];
	rep(i,h)rep(j,w){
		if(str[i][j]=='E'){
			if(!inside(j+1,i)||str[i][j+1]!='.'&&str[i][j+1]!='X')continue;
			if(inside(j+2,i)&&str[i][j+2]=='W')continue;
			if(inside(j+1,i-1)&&str[i-1][j+1]=='S')continue;
			next[i][j]='.';
			if(next[i][j+1]=='.')next[i][j+1]='E';
		}else if(str[i][j]=='N'){
			if(!inside(j,i-1)||str[i-1][j]!='.'&&str[i-1][j]!='X')continue;
			if(inside(j+1,i-1)&&str[i-1][j+1]=='W')continue;
			if(inside(j,i-2)&&str[i-2][j]=='S')continue;
			if(inside(j-1,i-1)&&str[i-1][j-1]=='S')continue;
			next[i][j]='.';
			if(next[i-1][j]=='.')next[i-1][j]='N';
		}else if(str[i][j]=='W'){
			if(!inside(j-1,i)||str[i][j-1]!='.'&&str[i][j-1]!='X')continue;
			next[i][j]='.';
			if(next[i][j-1]=='.')next[i][j-1]='W';
		}else if(str[i][j]=='S'){
			if(!inside(j,i+1)||str[i+1][j]!='.'&&str[i+1][j]!='X')continue;
			if(inside(j+1,i+1)&&str[i+1][j+1]=='W')continue;
			next[i][j]='.';
			if(next[i+1][j]=='.')next[i+1][j]='S';
		}
	}
	rep(i,40)str[i]=next[i];
}

void pv(){
	rep(i,h)cout<<str[i]<<endl;
}

int main() {
	for(;;){
		cin>>w>>h;
		if(w==0&&h==0)break;
		rep(i,h)cin>>str[i];
		int res;
		for(res=0;res<=180;++res){
			if(check())break;
			ch();
//pv();
			mv();
//pv();
		}
		if(res<=180)cout<<res<<endl;
		else cout<<"NA"<<endl;
	}
	return 0;
}