#include <bits/stdc++.h>
using namespace std;
const double eps(1e-8);
const int maxn = 1010;
const long long maxint = -1u >> 1;
const long long maxlong = maxint * maxint;
int n, MAX, reg, now, total, num;
int poww[maxn], dmg[maxn];
int used[maxn], ans[maxn][3];
void init() {
  cin >> n >> MAX >> reg;
  for (int i = 1; i <= n; i++) cin >> poww[i] >> dmg[i];
}
void work() {
  now = MAX;
  total = 0;
  num = 0;
  memset(used, -1, sizeof(used));
  for (int i = 0; i <= 10000; i++) {
    now -= total;
    now += reg;
    if (now <= 0) {
      cout << "YES" << endl;
      cout << i << " " << num << endl;
      for (int j = 1; j <= num; j++)
        cout << ans[j][0] << " " << ans[j][1] << endl;
      return;
    }
    if (now > MAX) now = MAX;
    int wjj = -1;
    for (int j = 1; j <= n; j++)
      if (poww[j] * MAX >= now * 100 && used[j] == -1)
        if (wjj == -1 || dmg[j] > dmg[wjj]) wjj = j;
    if (wjj != -1) {
      used[wjj] = true;
      total += dmg[wjj];
      num++;
      ans[num][0] = i;
      ans[num][1] = wjj;
    }
  }
  cout << "NO" << endl;
}
int main() {
  init();
  work();
  return 0;
}
