// Arup Guha
// 4/30/2007
// Solution to 2007 UCF HS Problem: Zombies, written in practice contest

import java.util.*;
import java.io.*;

public class zombies {

  public static void main(String[] args) throws IOException {

    Scanner fin = new Scanner(new File("zombies.in"));

	// Go through each case.
    int numcases = fin.nextInt();
    for (int z=1; z<=numcases; z++) {

	  // Read in zombie locations.
      int w = fin.nextInt();
      int h = fin.nextInt();
      int numzombies = fin.nextInt();
      int [][] coord = new int[numzombies][2];
      for (int i=0; i<numzombies; i++) {
        coord[i][0] = fin.nextInt();
        coord[i][1] = fin.nextInt();
      }

      // Will mark which ones we got.
      boolean[] gotit = new boolean[numzombies];

	  // See if we get a zombie right where we start!
      int curx = 1, cury = 1;
      for (int j=0; j<numzombies; j++)
        if (curx == coord[j][0] && cury == coord[j][1])
          gotit[j] = true;

      int moves = fin.nextInt();

	  // Simulate each move and see if we got a zombie.
      for (int i=0; i<moves; i++) {
        String dir = fin.next();
        if (dir.equals("N")) cury++;
        else if (dir.equals("S")) cury--;
        else if (dir.equals("E")) curx++;
        else if (dir.equals("W")) curx--;
        for (int j=0; j<numzombies; j++) {
          if (curx == coord[j][0] && cury == coord[j][1])
            gotit[j] = true;
        }
      }

      // Count the zombies.
      int numzs = 0;
      for (int i=0; i<numzombies; i++)
        if (gotit[i])
          numzs++;

      // Final result.
      System.out.println("Level "+z+": Crystel vanquished "+numzs+" zombies.");
    }

    fin.close();
  }
}