#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
long long int M = 1e9 + 7;
long long int MOD = 998244353;
const double PI = 3.141592653589793238460;
bitset<N> bs;
bitset<512> bb[512];
long long int power(long long int a, long long int b) {
  long long int res = 1;
  if (a == 0) return 0;
  if (a == 1) return 1;
  for (; b > 0; b >>= 1) {
    if (b & 1) {
      res = (res * a);
      if (res > M) res %= M;
    }
    a = (a * a);
    if (a > M) a = a % M;
  }
  return res;
}
bool check(long long int arr[], int k, long long int m, long long int n) {
  long long int sum = 0;
  for (int j = 0; j < n; j++) {
    sum += max(0ll, arr[j] - (j) / (k));
  }
  if (sum >= m) {
    return true;
  }
  return false;
}
vector<int> ans[200010];
int main() {
  int tt = 1;
  while (tt--) {
    long long int n, k;
    cin >> n >> k;
    if (n > k * (k - 1)) {
      cout << "no";
      return 0;
    }
    cout << "yes"
         << "\n";
    for (int i = 1; i <= k; i++) {
      int start = i;
      int curr = i % k;
      curr++;
      int cnt = 0;
      while (curr != i && (cnt * k) < n) {
        int no = (curr) % k;
        ans[i].push_back(curr);
        curr %= k;
        curr++;
        cnt++;
      }
    }
    int ff = 1, j = 0;
    for (int i = 1; i <= n; i++) {
      cout << ff << " " << ans[ff][j] << "\n";
      if (ff == k) j++;
      ff %= k;
      ff++;
    }
  }
}
