#include <bits/stdc++.h>
using namespace std;
const unsigned _mod = 998244353;
const unsigned mod = 1e9 + 7;
const long long infi = 0x3f3f3f3f3f3f3f3fll;
const int inf = 0x3f3f3f3f;
long long read() {
  long long x = 0, f = 1;
  char ch = getchar();
  while (ch > '9' || ch < '0') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = x * 10 + ch - '0';
    ch = getchar();
  }
  return x * f;
}
long long qpow(long long x, long long y, long long m) {
  long long ret = 1;
  while (y) {
    if (y & 1ll) ret = ret * x % m;
    y >>= 1ll;
    x = x * x % m;
  }
  return ret;
}
long long ksm(long long x, long long y) {
  long long ret = 1;
  while (y) {
    if (y & 1ll) ret = ret * x % mod;
    y >>= 1ll;
    x = x * x % mod;
  }
  return ret;
}
long long _gcd(long long x, long long y) { return y ? _gcd(y, x % y) : x; }
int a[1010], d[1010], n, h, r, c, t, ans[20010][2], z, mx, pos;
int main() {
  cin >> n >> h >> r;
  for (register int i = 1; i <= n; ++i) a[i] = read(), d[i] = read();
  c = h;
  while (c > 0) {
    t++;
    mx = -1;
    for (register int i = 1; i <= n; ++i)
      if (c * 100 <= a[i] * h)
        if (d[i] > mx) mx = d[i], pos = i;
    if (mx == -1 && r >= 0) return puts("NO"), 0;
    if (mx == -1) {
      c += r;
      continue;
    }
    r -= mx;
    a[pos] = -1;
    ans[++z][0] = t - 1;
    ans[z][1] = pos;
    c += r;
    c = min(c, h);
  }
  puts("YES");
  cout << t << ' ' << z << '\n';
  for (register int i = 1; i <= z; ++i)
    cout << ans[i][0] << ' ' << ans[i][1] << '\n';
  return 0;
}
