#include <bits/stdc++.h>
using namespace std;
struct compare {
  bool operator()(const int64_t& a, const int64_t& b) { return a > b; }
};
bool customS(pair<int, int> a, pair<int, int> b) {
  if (a.first == b.first) return a.second < b.second;
  return a.first > b.first;
}
bool customS2(pair<int64_t, int64_t> a, pair<int64_t, int64_t> b) {
  return (a.first) < (b.first);
}
class CompareDist {
 public:
  bool operator()(pair<int64_t, int64_t> a, pair<int64_t, int64_t> b) {
    return a.first < b.first;
  }
};
int64_t gcd(int64_t a, int64_t b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
double gcdfloat(double a, double b) {
  if (a < b) return gcd(b, a);
  if (fabs(b) < 0.001)
    return a;
  else
    return (gcd(b, a - floor(a / b) * b));
}
int64_t LCA(int64_t a, int64_t b) {
  while (a != b) {
    if (b > a) {
      swap(a, b);
    }
    a /= 2;
  }
  return a;
}
vector<int64_t> ra(int64_t n) {
  vector<int64_t> arr(n);
  for (int i = 0; i < n; i++) cin >> arr[i];
  return arr;
}
bool cmp(string s1, string s2) { return s1.length() < s2.length(); }
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int64_t i, j, a = 0, b = 0, c = 0, d = 0, n, m, k, sum = 0, x = 0, y = 0,
                z = 0, flag = 0, zero = 0, ans = 0;
  string s, newS;
  cin >> n >> k;
  vector<pair<int64_t, int64_t> > arr(n);
  for (i = 0; i < n; i++) cin >> arr[i].first >> arr[i].second;
  sort(arr.begin(), arr.end(), customS);
  i = 0;
  vector<int> res;
  while (i < n) {
    j = i + 1;
    while (j < n && arr[j].first == arr[i].first &&
           arr[j].second == arr[i].second)
      j++;
    res.push_back(j - i);
    i = j;
  }
  for (i = 0; i < res.size(); i++) {
    if (i > 0) res[i] += res[i - 1];
    if (res[i] >= k) {
      if (i > 0)
        cout << res[i] - res[i - 1] << endl;
      else
        cout << res[i] << endl;
      break;
    }
  }
  return 0;
}
