Go: package main

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

var (
	sc = bufio.NewScanner(os.Stdin)
)

type Point struct {
	X, Y int
}

type Gem struct {
	ID int
	Point
}

type Map struct {
	Current       *Point
	Gems          map[int]*Gem
	CollectedGems map[int]*Gem
}

func (m *Map) Move(dir string, l int) {
	switch {
	case dir == "N" || dir == "S":
		a := 1
		if dir == "S" {
			a = -1
		}
		for i := 0; i < l; i++ {
			m.Current.Y += a
			for _, g := range m.Gems {
				m.TryToTakeGem(g)
			}
		}
	case dir == "E" || dir == "W":
		a := 1
		if dir == "W" {
			a = -1
		}
		for i := 0; i < l; i++ {
			m.Current.X += a
			for _, g := range m.Gems {
				m.TryToTakeGem(g)
			}
		}
	}
}

func (m *Map) HasCompleted() bool {
	return len(m.Gems) == 0
}

func (m *Map) TryToTakeGem(g *Gem) {
	if m.Current.X == g.X && m.Current.Y == g.Y {
		m.CollectedGems[g.ID] = g
		delete(m.Gems, g.ID)
	}
}

func main() {
	for sc.Scan() {
		n, _ := strconv.Atoi(sc.Text())
		if n == 0 {
			break
		}
		m := &Map{
			Current:       &Point{X: 10, Y: 10},
			Gems:          map[int]*Gem{},
			CollectedGems: map[int]*Gem{},
		}
		for i := 0; i < n; i++ {
			sc.Scan()
			chunks := strings.Split(sc.Text(), " ")
			x, _ := strconv.Atoi(chunks[0])
			y, _ := strconv.Atoi(chunks[1])
			m.Gems[i+1] = &Gem{ID: i + 1, Point: Point{X: x, Y: y}}
		}
		sc.Scan()
		opCnt, _ := strconv.Atoi(sc.Text())
		for i := 0; i < opCnt; i++ {
			sc.Scan()
			chunks := strings.Split(sc.Text(), " ")
			dir := chunks[0]
			v, _ := strconv.Atoi(chunks[1])
			m.Move(dir, v)
		}
		msg := "No"
		if m.HasCompleted() {
			msg = "Yes"
		}
		fmt.Println(msg)
	}
}

C++: #include <iostream>
using namespace std;

int main(void){
  while(true){
    int n;
    cin >> n;
    if(n == 0)
      break;

    int plane[21][21] = {0};
    for(int i=0; i<n; i++){
      int x, y;
      cin >> x >> y;
      plane[x][y] = 1;
    }

    int m;
    cin >> m;
    int x = 10, y = 10;
    for(int i=0; i<m; i++){
      char d;
      int l;
      cin >> d >> l;

      int dx = 0, dy = 0;
      if(d == 'N')
        dy = 1;
      else if(d == 'S')
        dy = -1;
      else if(d == 'E')
        dx = 1;
      else
        dx = -1;

      for(int j=0; j<l; j++){
        x += dx;
        y += dy;
        if(plane[x][y] == 1){
          n--;
          plane[x][y] = 0;
        }
      }
    }

    if(n == 0)
      cout << "Yes" << endl;
    else
      cout << "No" << endl;
  }
  
  return 0;
}

C++: //45
#include<iostream>
#include<algorithm>

using namespace std;

int main(){
  for(int n;cin>>n,n;){
    bool g[21][21]={};
    for(int i=0;i<n;i++){
      int x,y;
      cin>>x>>y;
      g[y][x]=true;
    }
    g[10][10]=false;
    int m;
    cin>>m;
    int py=10,px=10;
    for(int i=0;i<m;i++){
      char d;
      int l;
      cin>>d>>l;
      while(l--){
	py+=(d=='N')-(d=='S');
	px+=(d=='E')-(d=='W');
	g[py][px]=false;
      }
    }
    cout<<((find(g[0],g[21],true)==g[21])?"Yes":"No")<<endl;
  }
  return 0;
}

C++: #include <iostream>
using namespace std;

int main()
{
	int n;
	while(cin >> n){
		if(!n)
			break;
		bool field[20][20];
		for(int i=0;i<20;i++){
			for(int j=0;j<20;j++){
				field[i][j] = false;
			}
		}
		int x,y;
		for(int i=0;i<n;i++){
			cin >> x >> y;
			field[y][x] = true;
		}
		int m;
		cin >> m;
		int count = 0;
		x = 10; y = 10;
		if(field[y][x] == true)
			count++;
		for(int i=0;i<m;i++){
			char h;
			int l;
			cin >> h >> l;
			switch(h){
				case 'N':
					for(int j=0;j<l;j++){
						y++;
						if(field[y][x]==true)
							count++;
					}
					break;
				case 'E':
					for(int j=0;j<l;j++){
						x++;
						if(field[y][x]==true)
							count++;
					}
					break;
				case 'S':
					for(int j=0;j<l;j++){
						y--;
						if(field[y][x]==true)
							count++;
					}
					break;
				case 'W':
					for(int j=0;j<l;j++){
						x--;
						if(field[y][x]==true)
							count++;
					}
					break;
			}
		}
		if(n == count)
			cout << "Yes" << endl;
		else
			cout << "No" << 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>

using namespace std;

typedef long long Int;
typedef vector<int> vint;
typedef pair<int,int> pint;
#define mp make_pair

template<class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cout << *i << " "; cout << endl; }
template<class T> void chmin(T &t, T f) { if (t > f) t = f; }
template<class T> void chmax(T &t, T f) { if (t < f) t = f; }
int in() { int x; scanf("%d", &x); return x; }

int m[21][21];

int main() {
	int n,x,y;
	while(n=in()){
		memset(m,0,sizeof(m));
		while(n--){
			cin>>x>>y;
			m[y][x]=1;
		}
		x=10;y=10;
		cin>>n;
		string d;
		int l,i;
		while(n--){
			cin>>d>>l;
			if(d=="N"){
				for(i=0;i<=l;i++){
					m[y+i][x]=0;
				}
				y+=l;
			}
			if(d=="S"){
				for(i=0;i<=l;i++){
					m[y-i][x]=0;
				}
				y-=l;
			}
			if(d=="E"){
				for(i=0;i<=l;i++){
					m[y][x+i]=0;
				}
				x+=l;
			}
			if(d=="W"){
				for(i=0;i<=l;i++){
					m[y][x-i]=0;
				}
				x-=l;
			}
		}
		bool ok=true;
		for(y=0;y<21;y++){
			for(x=0;x<21;x++){
//cout<<m[y][x];
				if(m[y][x])ok=false;
			}
//cout<<endl;
		}
		cout<<(ok?"Yes":"No")<<endl;
	}
	return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
#define FOR(i, s, n) for(int i = s; i < (int)n; i++)
#define per(i, n) for(int i = n; i >= 0; i--)
#define ROF(i, s, n) for(int i = s; i >= (int)n; i--)
#define FORIT(i, A) for (auto i : A)
#define PRINT(x) cout << (x) << "\n"
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define MP make_pair
#define EACH(i, n) for (__typeof((n).begin()) i = (n).begin(); i != (n).end(); ++i)
#define SZ(a) int((a).size())
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
#define CLR(a) memset((a), 0 ,sizeof(a))
#define dump(x) cout << #x << " = " << (x) << "\n";
#define debug(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << "\n";
#define sq(n) (n) * (n)
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef priority_queue<int> maxpq;
typedef priority_queue< int, vector<int>, greater<int> > minpq;
static const double EPS = 1e-10;
static const double PI = acos( -1.0 );
static const int mod = 10007;
static const int INF = 1 << 25;
static const LL LL_INF = 1152921504606846976;
static const int dx[] = { 1, -1, 0, 0,  1, -1,  1, -1 };
static const int dy[] = { 0, 0, 1, -1 , 1,  1, -1, -1 };
static const string Move = "EWNS";

int N, now_y, now_x, M, move_many, cnt;
char moves[ 1 ];
vector<PII> gems;

int gcd( int m, int n ) {
	if ( n == 0 ) return m;
	return gcd( n, m % n );
}

int main() {
	while ( ~scanf("%d", &N) && N ) {
		gems.resize( N );
		for ( int i = 0; i < N; i++ ) {
			scanf( "%d %d", &gems[ i ].first, &gems[ i ].second );
		}
		cnt = 0;
		sort( gems.begin(), gems.end() );
		now_y = 10;
		now_x = 10;
		scanf( "%d", &M );
		for ( int i = 0; i < M; i++ ) {
			scanf( "%c %d", moves, &move_many );
			for ( int j = 0; j < Move.size(); j++ ) {
				if ( Move[ j ] == moves[ 0 ] ) {
					for ( int k = 0; k < move_many; k++ ) {
						now_x += dx[ j ];
						now_y += dy[ j ];
						//printf( "X = %d Y = %d\n", now_x, now_y );
						for ( int l = 0; l < gems.size(); l++ ) {
							if ( gems[ l ] == PII( now_x, now_y ) ) {
								gems.erase( gems.begin() + l );
								cnt++;
								break;
							}
						}
					}
					break;
				}
			}
		}
		if ( !gems.size() || cnt == N ) {
			printf( "Yes\n" );
		}
		else {
			printf( "No\n" );
		}
	}
	return 0;
}