#include <bits/stdc++.h>
using namespace std;
int N, mx, rg, pw[1001], dm[1001], u[1001];
int main() {
  scanf("%d %d %d", &N, &mx, &rg);
  for (int i = 0, _n = N; i < _n; i++) scanf("%d %d", &pw[i], &dm[i]);
  int dps = 0, t = 0, H = mx;
  vector<pair<int, int> > S;
  while (true) {
    int s = -1;
    for (int i = 0, _n = N; i < _n; i++)
      if (H * 100 <= pw[i] * mx && !u[i])
        if (s == -1 || dm[s] < dm[i]) s = i;
    if (s == -1 && dps <= rg) {
      puts("NO");
      return 0;
    }
    if (s != -1) {
      S.push_back(make_pair(t, s));
      dps += dm[s];
      u[s] = 1;
    }
    H -= dps;
    H = min(mx, H + rg);
    t++;
    if (H <= 0) break;
  }
  puts("YES");
  printf("%d %d\n", t, S.size());
  for (int i = 0, _n = S.size(); i < _n; i++)
    printf("%d %d\n", S[i].first, S[i].second + 1);
}
