#include <bits/stdc++.h>
using namespace std;
#define all(x) x.begin(), x.end()
#define srtl(x)sort(all(x))
#define srtg(x)sort((x).begin(),(x).end(),greater<>())
#define rev(x) reverse(all(x))
#define lb(x,y) lower_bound(x.begin(),x.end(),y)-x.begin()
#define ub(x,y) upper_bound(x.begin(),x.end(),y)-x.begin()
#define ios ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define f first
#define s second
#define pb push_back
#define ins insert
#define next next_permutation
#define _b __builtin_popcount
#define ve vector
#define pii pair<int,int>
#define piii pair<int,pii>
#define vi vector<int>
#define vii vector<pii>
#define viii vector<piii>
#define vvi vector<vi>
//#define vs vector<string>
#define vb vector<bool>
#define pV(x)for(auto i:x)cout<<i<<" ";
#define geta(a){for(auto &i:a)cin>>i;}
#define fr(n)for(int i=0;i<n;i++)
#define Fr(n)for(int i=n-1;i>=0;i--)
#define suma(a)accumulate(a.begin(),a.end(),0LL)
#define br(x){cout<<x<<"\n";return;}
#define yesn cout<<"YES\n";
#define yes()br("YES");
#define no(){br("NO")}
#define alice() br("Alice");
#define bob() br("Bob");
#define cn continue;
#define cint const int
#define int long long
int mod=1000000007;
cint mod1=100000007;
cint mod2=998244353;
int ax[8]={0,1,0,-1,-1,1,1,-1};
int ay[8]={1,0,-1,0,1,-1,1,-1};
//bool on(int x,int y){return (x>=0&&x<n&&y>=0&&y<m);}
//int euc(int a,int b,int c,int d){return abs(a-c)+abs(b-d);}
int bp(int x,int y){
if(y==0)return 1;
int r=bp(x,y/2);
return (y&1)?r*r%mod*x%mod:r*r%mod;
}
int bpm(int x,int y){
if(y==0)return 1;
int r=bp(x,y/2);
return (y&1)?r*r*x:r*r;
}
int cinn(){
int n;
cin>>n;
return n;
}
#define w cinn()
int n,m;
cint N=300005;
vi tree(2*N);
int c=0;
void up(int p,int v){
p+=c;
tree[p]=v;
while(p!=0){
p/=2;
tree[p]=max(tree[p],v);
}
}
int qr(int l,int r){
l+=c;r+=c+1;
int res=0;
while(l<r){
if(l&1)res=max(res,tree[l++]);
if(r&1)res=max(res,tree[--r]);
l/=2;
r/=2;
}
return res;
}
void solve(){
cin>>n>>m;
vii v(n);
map<int,int>mp;
fr(n){
int x=w,y=w;
v[i]={y,x};
}
srtg(v);
vi a,aa;
fr(n){
a.pb(v[i].s);
}
aa=a;
vi p(m);
fr(m){
p[i]=w;
aa.pb(p[i]);
}
srtl(aa);
for(int i:aa){
if(mp[i]==0){
mp[i]=++c;
}
}
for(int &i:a){i=mp[i];}
for(int &i:p){i=mp[i];}
srtg(p);
rev(a);
int res=0;
for(int i=0;i<n;i++){
if(res==m)break;
int q=qr(a[i],c);
if(p[q]>=a[i]){
up(a[i],q+1);
res=max(res,q+1);
}
//else up(a[i],1);
}
cout<<res;
}
int32_t main(){
ios;
int t=1;
//cin>>t;
while(t--){
solve();
}
return 0;
}
/*
5 4
19 5
10 20
5 1
3 5
3 4
18 5 4 2
*/
