#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")

////////////////////////////////////////////////////////////////////////////////
template <unsigned M_> struct ModInt {
  static constexpr unsigned M = M_;
  unsigned x;
  constexpr ModInt() : x(0U) {}
  constexpr ModInt(unsigned x_) : x(x_ % M) {}
  constexpr ModInt(unsigned long long x_) : x(x_ % M) {}
  constexpr ModInt(int x_) : x(((x_ %= static_cast<int>(M)) < 0) ? (x_ + static_cast<int>(M)) : x_) {}
  constexpr ModInt(long long x_) : x(((x_ %= static_cast<long long>(M)) < 0) ? (x_ + static_cast<long long>(M)) : x_) {}
  ModInt &operator+=(const ModInt &a) { x = ((x += a.x) >= M) ? (x - M) : x; return *this; }
  ModInt &operator-=(const ModInt &a) { x = ((x -= a.x) >= M) ? (x + M) : x; return *this; }
  ModInt &operator*=(const ModInt &a) { x = (static_cast<unsigned long long>(x) * a.x) % M; return *this; }
  ModInt &operator/=(const ModInt &a) { return (*this *= a.inv()); }
  ModInt pow(long long e) const {
    if (e < 0) return inv().pow(-e);
    ModInt a = *this, b = 1U; for (; e; e >>= 1) { if (e & 1) b *= a; a *= a; } return b;
  }
  ModInt inv() const {
    unsigned a = M, b = x; int y = 0, z = 1;
    for (; b; ) { const unsigned q = a / b; const unsigned c = a - q * b; a = b; b = c; const int w = y - static_cast<int>(q) * z; y = z; z = w; }
    assert(a == 1U); return ModInt(y);
  }
  ModInt operator+() const { return *this; }
  ModInt operator-() const { ModInt a; a.x = x ? (M - x) : 0U; return a; }
  ModInt operator+(const ModInt &a) const { return (ModInt(*this) += a); }
  ModInt operator-(const ModInt &a) const { return (ModInt(*this) -= a); }
  ModInt operator*(const ModInt &a) const { return (ModInt(*this) *= a); }
  ModInt operator/(const ModInt &a) const { return (ModInt(*this) /= a); }
  template <class T> friend ModInt operator+(T a, const ModInt &b) { return (ModInt(a) += b); }
  template <class T> friend ModInt operator-(T a, const ModInt &b) { return (ModInt(a) -= b); }
  template <class T> friend ModInt operator*(T a, const ModInt &b) { return (ModInt(a) *= b); }
  template <class T> friend ModInt operator/(T a, const ModInt &b) { return (ModInt(a) /= b); }
  explicit operator bool() const { return x; }
  bool operator==(const ModInt &a) const { return (x == a.x); }
  bool operator!=(const ModInt &a) const { return (x != a.x); }
  friend std::ostream &operator<<(std::ostream &os, const ModInt &a) { return os << a.x; }
};
////////////////////////////////////////////////////////////////////////////////

constexpr unsigned MO = 998244353;
using Mint = ModInt<MO>;


int N, R;
vector<int> A, B;
vector<int> D;
vector<vector<int>> G;
vector<int> J;

vector<Mint> two;

vector<int> invA;

vector<int> par, dep;
vector<int> us;
void dfs(int u) {
  us.push_back(u);
  for (const int v : G[u]) {
    par[v] = u;
    dep[v] = dep[u] + 1;
    dfs(v);
  }
}

bool prob1() {
  auto bs = B;
  for (int j = N; --j >= 1; ) {
    const int u = us[j];
    if (A[u] != bs[u]) swap(bs[par[u]], bs[u]);
    if (A[u] != bs[u]) return false;
  }
  return true;
}

Mint prob3_brute() {
  Mint ans = 0;
  int now = N - 1;
  vector<int> on(N, 0);
  vector<int> fs(N, -1);
  for (int u = 0; u < N; ++u) {
// cerr<<"u = "<<u<<endl;
    for (int v = u; ~v; v = par[v]) on[v] = 1;
    auto check = [&](int phase) -> bool {
      int tmp = now;
      for (int j0 = D[u] - 1, v = u; ~v; j0 = J[v], v = par[v]) {
        for (int j = j0; j >= 0; --j) {
          const int w = G[v][j];
// cerr<<"  fs = "<<fs<<", phase = "<<phase<<", w = "<<w<<", tmp = "<<tmp<<endl;
          if (phase == 0 && A[w] < B[u]) {
            if (!~fs[w]) {
// cerr<<"    ans += 2^"<<tmp-1<<endl;
              ans += two[tmp - 1];
            } else if (fs[w] != on[w]) {
// cerr<<"    ans += 2^"<<tmp<<endl;
              ans += two[tmp];
            }
          }
          if (phase == 1 && A[w] == B[u]) {
            if (!~fs[w]) {
              --tmp;
              fs[w] = on[w] ^ 1;
            } else if (fs[w] == on[w]) {
              return false;
            }
            now = tmp;
            return true;
          }
          if (!~fs[w]) {
            --tmp;
            if (phase == 1) {
              fs[w] = on[w];
            }
          } else if (fs[w] != on[w]) {
            return false;
          }
        }
      }
      if (phase == 0 && A[R] < B[u]) {
// cerr<<"  fs = "<<fs<<", phase = "<<phase<<", R = "<<R<<", tmp = "<<tmp<<endl;
// cerr<<"    ans += 2^"<<tmp<<endl;
        ans += two[tmp];
      }
      if (phase == 1 && A[R] == B[u]) {
        now = tmp;
        return true;
      }
      return false;
    };
    check(0);
    if (!check(1)) {
      break;
    }
    for (int v = u; ~v; v = par[v]) on[v] = 0;
// cerr<<"  fs = "<<fs<<", now = "<<now<<", ans = "<<ans<<endl;
  }
  return ans;
}

int main() {
  for (; ~scanf("%d%d", &N, &R); ) {
    --R;
    A.resize(N);
    for (int u = 0; u < N; ++u) {
      scanf("%d", &A[u]);
      --A[u];
    }
    D.resize(N);
    G.resize(N);
    J.assign(N, -1);
    for (int u = 0; u < N; ++u) {
      scanf("%d", &D[u]);
      G[u].resize(D[u]);
      for (int j = 0; j < D[u]; ++j) {
        scanf("%d", &G[u][j]);
        --G[u][j];
        J[G[u][j]] = j;
      }
    }
    B.resize(N);
    for (int u = 0; u < N; ++u) {
      scanf("%d", &B[u]);
      --B[u];
    }
    
    two.resize(N + 1);
    two[0] = 1;
    for (int i = 1; i <= N; ++i) two[i] = two[i - 1] * 2;
    
    invA.assign(N, -1);
    for (int u = 0; u < N; ++u) {
      invA[A[u]] = u;
    }
    
    par.assign(N, -1);
    dep.assign(N, 0);
    us.clear();
    dfs(R);
    
    const int maxD = *max_element(D.begin(), D.end());
    const int maxDep = *max_element(dep.begin(), dep.end());
    
    const bool ans1 = prob1();
    puts(ans1 ? "YES" : "NO");
    puts("no comment");
if(1){//    if (maxD <= 20 && maxDep <= 20) {
      const Mint ans3 = prob3_brute();
      printf("%u\n", ans3.x);
    } else {
      puts("no comment");
    }
  }
  return 0;
}