#include <string>
#include <vector>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<stack>
#include<queue>
#include<cmath>
#include<algorithm>
#include<functional>
#include<list>
#include<deque>
#include<bitset>
#include<set>
#include<map>
#include<unordered_map>
#include<unordered_set>
#include<cstring>
#include<sstream>
#include<complex>
#include<iomanip>
#include<numeric>
#include<cassert>
#define X first
#define Y second
#define pb push_back
#define rep(X,Y) for (int (X) = 0;(X) < (Y);++(X))
#define reps(X,S,Y) for (int (X) = S;(X) < (Y);++(X))
#define rrep(X,Y) for (int (X) = (Y)-1;(X) >=0;--(X))
#define rreps(X,S,Y) for (int (X) = (Y)-1;(X) >= (S);--(X))
#define repe(X,Y) for ((X) = 0;(X) < (Y);++(X))
#define peat(X,Y) for (;(X) < (Y);++(X))
#define all(X) (X).begin(),(X).end()
#define rall(X) (X).rbegin(),(X).rend()
#define eb emplace_back
#define UNIQUE(X) (X).erase(unique(all(X)),(X).end())
#define Endl endl

using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
template<class T> using vv=vector<vector<T>>;
template<class T> ostream& operator<<(ostream &os, const vector<T> &t) {
os<<"{"; rep(i,t.size()) {os<<t[i]<<",";} os<<"}"<<endl; return os;}
template<class T,size_t n> ostream& operator<<(ostream &os, const array<T,n> &t) {
	os<<"{"; rep(i,n) {os<<t[i]<<",";} os<<"}"<<endl; return os;}
template<class S, class T> ostream& operator<<(ostream &os, const pair<S,T> &t) { return os<<"("<<t.first<<","<<t.second<<")";}
template<class S, class T,class U> ostream& operator<<(ostream &os, const tuple<S,T,U> &t) { return os<<"("<<get<0>(t)<<","<<get<1>(t)<<","<<get<2>(t)<<")";}
template<class S, class T,class U,class V> ostream& operator<<(ostream &os, const tuple<S,T,U,V> &t) { return os<<"("<<get<0>(t)<<","<<get<1>(t)<<","<<get<2>(t)<<","<<get<3>(t)<<")";}
template<class S, class T,class U,class V,class W> ostream& operator<<(ostream &os, const tuple<S,T,U,V,W> &t) { return os<<"("<<get<0>(t)<<","<<get<1>(t)<<","<<get<2>(t)<<","<<get<3>(t)<<","<<get<4>(t)<<")";}
template<class T> inline bool MX(T &l,const T &r){return l<r?l=r,1:0;}
template<class T> inline bool MN(T &l,const T &r){return l>r?l=r,1:0;}
//#undef NUIP
#ifdef NUIP
#define out(args...){vector<string> a_r_g_s=s_p_l_i_t(#args, ','); e_r_r(a_r_g_s.begin(), args); }
vector<string> s_p_l_i_t(const string &s, char c){vector<string> v;int d=0,f=0;string t;for(char c:s){if(!d&&c==',')v.pb(t),t="";else t+=c;if(c=='\"'||c=='\'')f^=1;if(!f&&c=='(')++d;if(!f&&c==')')--d;}v.pb(t);return move(v);}
void e_r_r(vector<string>::iterator it) {}
template<typename T, typename... Args> void e_r_r(vector<string>::iterator it, T a, Args... args){ if(*it==" 1"||*it=="1") cerr<<endl; else cerr << it -> substr((*it)[0] == ' ', it -> length()) << " = " << a << ", "; e_r_r(++it, args...);}
#else
#define out
#endif
#ifdef __cpp_init_captures
template<typename T>vector<T> table(int n, T v){ return vector<T>(n, v);}
template <class... Args> auto table(int n, Args... args){auto val = table(args...); return vector<decltype(val)>(n, move(val));}
#endif
const ll MOD=1e9+7;

int dst[333][333];
vector<int> inv[333][333];

int main(){
  ios_base::sync_with_stdio(false);
  cout<<fixed<<setprecision(0);
	string P,Q;
	int n;
	cin>>P>>Q>>n;
	vector<string> names{P,Q};
	vv<pair<string,string>> docs_(n);
	rep(i,n){
		int m;
		cin>>m;
		auto &v=docs_[i];
		rep(i,m){
			string a,b;
			cin>>a>>b;
			names.eb(a);
			names.eb(b);
			v.eb(a,b);
		}
	}
	sort(all(names)); UNIQUE(names);
	int m=names.size();
	if(m>310) return 0;
	rep(i,m) dst[i][i]=1;
	int p=lower_bound(all(names),P)-names.begin();
	int q=lower_bound(all(names),Q)-names.begin();
	vv<pii> docs(n);
	rep(i,n)rep(j,docs_[i].size()){
		int a=lower_bound(all(names),docs_[i][j].X)-names.begin();
		int b=lower_bound(all(names),docs_[i][j].Y)-names.begin();
		docs[i].eb(a,b);
		inv[a][b].pb(i);
	}
	out(docs,1);
	queue<int> que;
	vector<int> usd(n);
	auto allow=
		[&](int a,int b){
			if(dst[a][b]) return;
			dst[a][b]=1;
			for(int i:inv[a][b])if(MX(usd[i],1)) que.emplace(i);
		};
	allow(p,q);
	int ok=1;
	while(que.size()){
		int i=que.front(); que.pop();
		// for(pii p:docs[i]) allow(p.X,p.Y);
		// rep(k,m)rep(i,m)rep(j,m)if(dst[i][k] && dst[k][j]) allow(i,j);
		for(pii p:docs[i])if(!dst[p.X][p.Y])rep(s,m)if(dst[s][p.X])rep(t,m)if(dst[p.Y][t]) allow(s,t);
		rep(i,m)rep(j,i)if(dst[i][j] && dst[j][i]) ok=0;
		if(!ok) break;
	}
	rep(i,m)rep(j,i)if(dst[i][j] && dst[j][i]) ok=0;
	cout<<(ok?"Yes":"No")<<endl;
  return 0;
}



Measured memory_bytes: 22376