#include <bits/stdc++.h>
const long long mod = 1e9 + 7;
using namespace std;
const int maxn = 1005;
vector<pair<int, int> > ans;
int b[maxn], c[maxn], vis[maxn];
int main() {
  int n, hp, reg;
  scanf("%d%d%d", &n, &hp, &reg);
  for (int i = 0; i < n; i++) scanf("%d%d", &b[i], &c[i]);
  int cur = hp, dmg = 0, t = 0;
  int flag = 0;
  while (cur > 0) {
    cur -= dmg;
    cur += reg;
    cur = min(hp, cur);
    if (cur <= 0) break;
    int p = -1;
    for (int i = 0; i < n; i++) {
      if (!vis[i] && b[i] * hp >= 100 * cur) {
        if (p == -1 || c[i] > c[p]) p = i;
      }
    }
    if (p != -1) {
      vis[p] = 1;
      dmg += c[p];
      ans.push_back(make_pair(t, p + 1));
    } else {
      if (cur == hp) {
        flag = 1;
        break;
      }
    }
    ++t;
  }
  if (flag)
    return puts("NO"), 0;
  else {
    printf("YES\n");
    printf("%d %d\n", t, ans.size());
    for (int i = 0; i < ans.size(); i++)
      cout << ans[i].first << " " << ans[i].second << endl;
  }
}
