不知道WA在哪，udebug上对拍过了

#include<cstdio>
#include<iostream>
#include<cstring>
#include<cctype>
#include<queue>
#include<vector>
#include<string>
#include<sstream>
using namespace std;

const int maxn = 20;

struct Node{
	int r, c, dir;
	Node(int r = 0, int c = 0, int dir = 0) : r(r), c(c), dir(dir) {}
};

const char* dirs = "NESW";				//↑→↓← 
const char* turns = "FLR";
inline int dir_id(char c) { return strchr(dirs, c) - dirs; }
inline int turn_id(char c) { return strchr(turns, c) - turns; }
inline bool inside(int r, int c) { return r >= 1 && r <= 9 && c >= 1 && c <= 9; }

const int dr[] = {-1, 0, 1, 0};
const int dc[] = {0, 1, 0, -1};
int r0, c0, dir0, r1, c1, r2, c2;
int dis[maxn][maxn][5], has_edge[maxn][maxn][5][5];
Node pre[maxn][maxn][5];

Node walk(const Node& u, int turn) {
	int dir = u.dir;
	if(turn == 1) dir = (dir + 3) % 4;
	if(turn == 2) dir = (dir + 1) % 4;
	return Node(u.r + dr[dir], u.c + dc[dir], dir);
}

void print_ans(Node u){
	vector<Node> nodes;
	for(;;){
		nodes.push_back(u);
		if(dis[u.r][u.c][u.dir] == 0) break;
		u = pre[u.r][u.c][u.dir];
	}
	nodes.push_back(Node(r0, c0, dir0));
	
	int cnt = 0;
	for(int i = nodes.size()-1; i >= 0; i--){
		if(cnt % 10 == 0) cout << ' ';
		cout << " (" << nodes[i].r << "," << nodes[i].c << ")";
		if(++cnt % 10 == 0) cout << endl;
	}
	if(nodes.size() % 10 != 0) cout << endl;
}

void solve(){
	queue<Node> q;
	memset(dis, -1, sizeof(dis));
	Node u(r1, c1, dir0);
	dis[u.r][u.c][u.dir] = 0;
	q.push(u);
	while(!q.empty()){
		Node u = q.front(); q.pop();
		if(u.r == r2 && u.c == c2) { print_ans(u); return; }
		for(int i = 0; i < 3; i++){
			Node v = walk(u, i);
			if(has_edge[u.r][u.c][u.dir][i] && inside(v.r, v.c) && dis[v.r][v.c][v.dir] < 0){
				dis[v.r][v.c][v.dir] = dis[u.r][u.c][u.dir] + 1;
				pre[v.r][v.c][v.dir] = u;
				q.push(v);
			}
		}
	}
	cout << "  No Solution Possible" << endl;
}

int main(){
	string line;
	while(getline(cin, line) && line != "END"){
		cout << line << endl;
		memset(has_edge, 0, sizeof(has_edge));
		char ch;
		cin >> r0 >> c0 >> ch >> r2 >> c2;
		dir0 = dir_id(ch);
		Node a = walk(Node(r0, c0, dir0), dir0);
		r1 = a.r; c1 = a.c;
		int r, c;
		while(getline(cin, line) && line != "0"){
			stringstream ss(line);
			ss >> r >> c;
			string str;
			while(ss >> str && str != "*"){
				int dir = dir_id(str[0]);
				for(int i = 1; i < str.size(); i++){
					int turn = turn_id(str[i]);
					has_edge[r][c][dir][turn] = 1;
				}
			}
		}
		solve();
	}
	return 0;
}