// –Í‹[’n‹æ—\‘I2010 C. Dungeon Quest II

#include <iostream>
#include <vector>
#include <string>
#include <cstring>

using namespace std;

int dx[] = {-1, 1, 0, 0};
int dy[] = {0, 0, 1, -1};

int main(){
	int dmg[26];
	string mp[100];
	int HP, HPmax;
	int reg[12];
	int dp[2][1<<12];
	while(cin >> HP >> HPmax, HP){
		int R, C; cin >> R >> C;
		for(int i=0;i<R;i++) cin >> mp[i];
		int T; cin >> T;
		for(int i=0;i<T;i++){
			char c; int d; cin >> c >> d;
			dmg[c-'A'] = d;
		}
		int S; cin >> S;
		vector<int> act;
		for(int i=0;i<S;i++){
			char c; int d; cin >> c >> d;
			for(int j=0;j<d;j++){
				if(c=='U') act.push_back(0);
				if(c=='D') act.push_back(1);
				if(c=='R') act.push_back(2);
				if(c=='L') act.push_back(3);
			}
		}
		int P; cin >> P;
		for(int i=0;i<P;i++) cin >> reg[i];
		memset(dp, 0, sizeof(dp));
		dp[0][(1<<P)-1] = HP;
		int x = 0, y = 0;
		int cur = 0, next = 1;
		for(int i=0;i<act.size();i++){
			memset(dp[next], 0, sizeof(dp[next]));
			x += dx[act[i]];
			y += dy[act[i]];
			int damage = dmg[mp[x][y]-'A'];
			for(int j=(1<<P)-1;j>=0;j--){
				if(dp[cur][j] == 0) continue;
				if(dp[cur][j] > damage) dp[next][j] = max(dp[next][j], dp[cur][j]-damage);
				for(int k=0;k<P;k++){
					if(!(j&(1<<k))) continue;
					dp[cur][j^(1<<k)] = max(min(HPmax, dp[cur][j]+reg[k]), dp[cur][j^(1<<k)]);
				}
			}
			swap(cur, next);
		}
		cout << (dp[cur][0] > 0 ? "YES" : "NO") << endl;
	}
}