#include <bits/stdc++.h>
// #include <atcoder/all>
// #include "icld.cpp"
using namespace std;
using ll = long long int;
using vi = vector<int>;
using si = set<int>;
using vll = vector<ll>;
using vvi = vector<vector<int>>;
using ss = string;
using db = double;
template<typename T> using minpq = priority_queue <T,vector<T>,greater<T>>;
const int dx[4] = {1,0,-1,0};
const int dy[4] = {0,1,0,-1};
#define V vector
#define P pair<int,int>
#define PLL pair<ll,ll>
#define rep(i,s,n) for(int i=(s);i<(int)(n);i++)
#define rev(i,s,n) for(int i=(s);i>=(int)(n);i--)
#define reciv(v,n) vll (v)((n)); rep(i,0,(n))cin>>v[i]
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define ci(x) cin >> x
#define cii(x) ll x;cin >> x
#define cci(x,y) ll x,y;cin >> x >> y
#define co(x) cout << x << endl
#define pb push_back
#define eb emplace_back
#define rz resize
#define pu push
#define sz(x) int(x.size())
#define vij v[i][j]
// ll p = 1e9+7;
// ll p = 998244353;
// n do -> n*pi/180
#define yn cout<<"Yes"<<endl;else cout<<"No"<<endl
#define YN cout<<"YES"<<endl;else cout<<"NO"<<endl
template<class T>void chmax(T &x,T y){x=max(x,y);}
template<class T>void chmin(T &x,T y){x=min(x,y);}

int main(){
  vi v(1e3+10);
  cci(n,m);
  rep(i,0,n){
    cii(x);
    v[x]++;
  }
  rep(i,0,m){
    cii(x);
    v[x]++;
  }

  rep(i,0,1e3+10){
    if(v[i]==1)cout<<i<<" ";
  }
  co("");
}
#include<bits/stdc++.h>
#define mp make_pair
#define fi first
#define se second
#define pb push_back
#define endl "\n"
#define rep(i,j,k) for(int i=j;i<=k;i++) 
#define dec(i,j,k) for(int i=j;i>=k;i--)
const int mod = 1e9+7;
const int N = 3e5+5;
using namespace std;
#define debug(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); err(_it, args);}
void err(istream_iterator<string> it) {}
template<typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
	cerr << *it << " = " << a << " ";
	err(++it, args...);
}
typedef long long ll;
//int arr[N];
ll n,m,k,q,Q,l,r,p;
ll arr[N];


void solve()
{  ll n,m,t,val,x,y,p;
   cin >> n >> m >> t;
   val = n;
   bool ok = true;
   p = 0;
   for(int i = 0; i < m; i++)
   {   
	   cin >> x >> y;
	   val = max(0LL,val-(x-p));
	 //  debug(x-p);
	 if(!val)
		 ok = false;
	   val = min(n,val+(y-x)); 
       p = y;	   
   }
   val = max(0LL,val-(t-p));
   if(!val)
	   ok  = false;
   //cout << val;
   cout << (ok ? "Yes":"No");
   cout << "\n";
   cerr << "\n";
}
int main()
{ ios_base::sync_with_stdio(false);cin.tie(NULL);
 #ifndef ONLINE_JUDGE
   freopen("fi.txt","r",stdin);
   freopen("fo.txt","w",stdout); 
   freopen("err.txt","w",stderr);
 #endif
  int t;
  t=1;

  //cin>>t;
  int a = 0;
  while(t--)
  {   //cout<<"Case #"<<++a<<": ";
	  solve();
  }
  return 0;
}