#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, q;
  cin >> n >> q;
  vector<tuple<VI, VI, int>> constraints(q);
  constexpr long long INF = 1002003004005006007;
  vector<vector<P>> vec(n);
  VL covec(q);
  rep(qq, q) {
    int a, b, m;
    cin >> a >> b >> m;
    m++;
    m *= -1;
    covec[qq] = m;
    char c;
    cin >> c;
    VI coeff(n);
    rep(_, a) {
      int i;
      cin >> i;
      coeff[i-1]--;
    }
    cin >> c;
    rep(_, b) {
      int i;
      cin >> i;
      coeff[i-1]++;
    }
    rep(i, n) {
      if (coeff[i]) vec[i].emplace_back(qq, coeff[i]);
    }
  }
  dsu uf(q);
  for (auto v : vec) {
    if (ssize(v) <= 1 || v[0].second == v[1].second) {
      for (auto [i, _] : v) covec[i] = INF;
    } else {
      uf.merge(v[0].first, v[1].first);
    }
  }
  bool ans = true;
  for (auto g : uf.groups()) {
    ll sm = 0;
    for (int i : g) {
      sm = min(INF, sm + covec[i]);
    }
    ans &= sm >= 0;
  }
  cout << (!ans ? "Yes\n" : "No\n");
}