#include<iostream>
#include<functional>
#include<algorithm>
#include<cstring>
#include<string>
#include<cstdio>
#include<vector>
#include<queue>
#include<set>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;

#define T 100000 + 50
 


struct node
{
	ll v;
	bool operator<(const node& b)const{
		return v<b.v;
	}
}a[T];

struct line
{
	ll val;
	line():val(0){}
	line(ll _2):val(_2){}
	bool operator<(const line& b)const{
		return val>b.val;
	}
};

ll v[T];

bool cmp(const ll& a,const ll& b){return a>b;}

int
 
 main()
{
	int n,m,i,j;
	while(~scanf("%d%d",&n,&m))
	{
		ll c = 0;
		ll sum = 0;
		for(i=0;i<n;++i){
			scanf("%lld",&a[i].v);
		}
		sort(a,a+n);
		fill(v,v+T,0);
		multiset< ll,greater<int> > Q;
		multiset< ll,greater<int> >::iterator it;
		ll k;
		Q.insert(a[0].v+1000
 
);
		ll cnt;
		for(i=1;i<n;++i){
 			it = Q.begin();
			k = *it;
   			it = Q.lower_bound(a[i].v);
			if(it==Q.end()){
				Q.insert(a[i].v+1000);
			}
			else if(it!=Q.end()){
				 Q.erase(it);
				Q.insert(a[i].v+1000);
			}
		}
		cnt = Q.size();
		Q.clear();
		if(cnt%m>0)cnt = cnt/m+1;
		else cnt = cnt/m;
		printf("%lld\n",cnt);
	}
	return 0;
}

#include<iostream>
#include<functional>
#include<algorithm>
#include<cstring>
#include<string>
#include<cstdio>
#include<vector>
#include<queue>
#include<set>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;

#define T 100000 + 50

struct node
{
	ll L,R;
	bool operator<(const node& b)const{
		return R<b.R;
	}
}a[T];

struct line
{
	ll val;
	line():val(0){}
	line(ll _2):val(_2){}
	bool operator<(const line& b)const{
		return val>b.val;
	}
};

ll v[T];

bool cmp(const ll& a,const ll& b){return a>b;}

int main()
{
#ifdef zsc
	freopen("input.txt","r",stdin);
#endif
	int n,m,i,j;
	while(~scanf("%d%d",&n,&m))
	{
		ll c = 0;
		ll sum = 0;
		for(i=0;i<n;++i){
			scanf("%lld%lld",&a[i].L,&a[i].R);
		}
		if(m>=n){
			printf("%d\n",n);
			continue;
		}
		sort(a,a+n);
		fill(v,v+T,0);
		multiset< ll,greater<int> > Q;
		multiset< ll,greater<int> >::iterator it;
		ll k;
		Q.insert(a[0].R);
		c = 1;
		int cnt = 1;
		for(i=1;i<n;++i){
 			it = Q.begin();
			k = *it;
			it = Q.lower_bound(a[i].L);
			if(it==Q.end()&&cnt<m){
				c ++;cnt++;
				Q.insert(a[i].R);
			}
			else if(it!=Q.end()&&cnt<=m){
				c++;
				Q.erase(it);
				Q.insert(a[i].R);
			}
		}
		Q.clear();
		printf("%lld\n",c);
	}
	return 0;
}

#include<map>
#include<set>
#include<cmath>
#include<ctime>
#include<stack>
#include<queue>
#include<cstdio>
#include<cctype>
#include<bitset>
#include<string>
#include<vector>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<functional>
#define fuck(x) cout<<"["<<x<<"]"
#define FIN freopen("input.txt","r",stdin)
#define FOUT freopen("output.txt","w+",stdout)
//#pragma comment(linker, "/STACK:102400000,102400000")
using namespace std;
typedef long long LL;
 
const int MX = 3e3 + 5;
struct Point {
    int x, y, d; //下左上右
} P[MX];
struct Data {
    int val, id;
    Data() {}
    Data(int _id, int _val) {
        val = _val; id = _id;
    }
    bool operator<(const Data &P) const {
        return val < P.val;
    }
};
 
set<Data>X[MX], Y[MX];
int tmpX[MX], tmpY[MX];
 
int solve(int u) {
    int begin = u;
    set<Data>::iterator it;
    int ret = 0;
    while(true) {
        ret++;
        X[P[u].x].erase(Data(u, P[u].y));
        Y[P[u].y].erase(Data(u, P[u].x));
        if(P[u].d == 0) {
            it = X[P[u].x].lower_bound(Data(0, P[u].y));
            if(it == X[P[u].x].begin()) return ret;
            it--;
        }
        if(P[u].d == 1) {
            it = Y[P[u].y].lower_bound(Data(0, P[u].x));
            if(it == Y[P[u].y].begin()) return ret;
            it--;
        }
        if(P[u].d == 2) {
            it = X[P[u].x].upper_bound(Data(0, P[u].y));
            if(it == X[P[u].x].end()) return ret;
        }
        if(P[u].d == 3) {
            it = Y[P[u].y].upper_bound(Data(0, P[u].x));
            if(it == Y[P[u].y].end()) return ret;
        }
        //if(begin==5&&P[u].x==2&&P[u].y==1) fuck(P[u].d);
        u = it->id;
    }
    return ret;
}
 
int main() {
    int n; //FIN;
    while(~scanf("%d", &n)) {
        for(int i = 1; i <= n; i++) {
            char w[10];
            scanf("%d%d%s", &P[i].x, &P[i].y, w);
            tmpX[i] = P[i].x; tmpY[i] = P[i].y;
            if(w[0] == 'v') P[i].d = 2;
            if(w[0] == '<') P[i].d = 1;
            if(w[0] == '^') P[i].d = 0;
            if(w[0] == '>') P[i].d = 3;
        }
        int sz1, sz2;
        sort(tmpX + 1, tmpX + 1 + n);
        sort(tmpY + 1, tmpY + 1 + n);
        sz1 = unique(tmpX + 1, tmpX + 1 + n) - tmpX - 1;
        sz2 = unique(tmpY + 1, tmpY + 1 + n) - tmpY - 1;
 
        for(int i = 1; i <= n; i++) {
            P[i].x = lower_bound(tmpX + 1, tmpX + 1 + sz1, P[i].x) - tmpX;
            P[i].y = lower_bound(tmpY + 1, tmpY + 1 + sz2, P[i].y) - tmpY;
        }
 
        int ans = 0;
        for(int u = 1; u <= n; u++) {
            for(int i = 1; i <= sz1; i++) X[i].clear();
            for(int i = 1; i <= sz2; i++) Y[i].clear();
            for(int i = 1; i <= n; i++) {
                X[P[i].x].insert(Data(i, P[i].y));
                Y[P[i].y].insert(Data(i, P[i].x));
            }
            int t = solve(u);
            ans = max(ans, t);
        }
        printf("%d\n", ans);
    }
    return 0;
}

#include<map>
#include<set>
#include<cmath>
#include<ctime>
#include<stack>
#include<queue>
#include<cstdio>
#include<cctype>
#include<bitset>
#include<string>
#include<vector>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<functional>
#define fuck(x) cout<<"["<<x<<"]"
#define FIN freopen("input.txt","r",stdin)
#define FOUT freopen("output.txt","w+",stdout)
//#pragma comment(linker, "/STACK:102400000,102400000")
using namespace std;
typedef long long LL;
 
const int MX = 1e3 + 5;
struct Node {
    int x, y, z;
    Node() {}
    Node(int _x, int _y, int _z) {
        x = _x; y = _y; z = _z;
    }
    bool operator<(const Node &P) const {
        if(x == P.x) {
            if(y == P.y) return z < P.z;
            return y < P.y;
        }
        return x < P.x;
    }
};
 
LL A, B, C;
multiset<Node>S;
bool check(int x, int y, int z) {
    if(x < 1 || x > A || y < 1 || y > B || z < 1 || z > C) return false;
    if(S.count(Node(x, y, z))) return false;
    return true;
}
int f(int x) {
    if(x == 0) return -2;
    if(x == 1) return 0;
    return 2;
}
 
int main() {
    int n; //FIN;
    while(~scanf("%lld%lld%lld%d", &A, &B, &C, &n)) {
        LL ans = 2 * A * B + 2 * A * C + 2 * B * C;
        S.clear();
 
        for(int i = 1; i <= n; i++) {
            int x, y, z;
            scanf("%d%d%d", &x, &y, &z);
            x++; y++; z++;
 
            ans += f(check(x - 1, y, z) + check(x + 1, y, z));
            ans += f(check(x, y - 1, z) + check(x, y + 1, z));
            ans += f(check(x, y, z - 1) + check(x, y, z + 1));
            S.insert(Node(x, y, z));
        }
        printf("%lld\n", ans);
    }
    return 0;
}