#include <bits/stdc++.h>
using namespace std;
long long int M = 1000000007;
long long int min(long long int a, long long int b, long long int c,
                  long long int d) {
  long long int arr[4] = {a, b, c, d};
  sort(arr, arr + 4);
  return arr[0];
}
long long int max(long long int a, long long int b, long long int c,
                  long long int d) {
  long long int arr[4] = {a, b, c, d};
  sort(arr, arr + 4);
  return arr[3];
}
long long int gcd(long long int a, long long int b) {
  if (b < a) {
    int temp = a;
    a = b;
    b = temp;
  }
  if (a == 0) {
    return b;
  }
  return gcd(b % a, a);
}
long long int lcm(long long int a, long long int b) {
  return (a * b / gcd(a, b));
}
vector<long long int> getprimes() {
  vector<long long int> pl(101, 1);
  for (int i = 2; i <= 100; i++) {
    if (pl[i] == 1) {
      for (int j = 2 * i; j <= 100; j += i) {
        pl[j] = 0;
      }
    }
  }
  return pl;
}
double distsqrd(double x1, double y1, double x2, double y2) {
  return (x2 - x1) * (x2 - x1) + (y2 - y1) * (y2 - y1);
}
long long int fact(long long int first) {
  long long int ans = 1;
  if (first == 0) {
    return 1;
  }
  while (first > 0) {
    ans = (ans * first) % 1000000007;
    first--;
  }
  return ans % 1000000007;
}
long long int power(long long int a, long long int b) {
  long long int ans = 1;
  while (b > 0) {
    if (b % 2 == 1) {
      ans *= a;
      ans = ans;
    }
    b /= 2;
    a *= a;
    a = a;
  }
  return ans;
}
vector<int> getbinary(int first) {
  vector<int> bin(10, 0);
  int iter = 0;
  while (first > 0) {
    if (first % 2 == 1) {
      bin[iter] = 1;
    } else {
      bin[iter] = 0;
    }
    iter++;
    first /= 2;
  }
  return bin;
}
int getnum(vector<int> bin) {
  int t = 1;
  int n = bin.size();
  int ret = 0;
  for (int i = 0; i < n; i++) {
    ret += t * bin[i];
    t *= 2;
  }
  return ret;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long int n, max, reg;
  cin >> n >> max >> reg;
  pair<int, int> s[n];
  for (int i = 0; i < n; i++) {
    cin >> s[i].first >> s[i].second;
    s[i].first = s[i].first * max / 100;
  }
  int health = max;
  int damage = 0;
  vector<pair<int, int> > ans;
  long long int tim = 0;
  map<int, int> m;
  while (health > 0) {
    int maxx = -1, maxind;
    for (int i = 0; i < n; i++) {
      if (s[i].first >= health && m[i] == 0) {
        if (maxx < s[i].second) {
          maxx = s[i].second;
          maxind = i;
        }
      }
    }
    if (maxx == -1 && damage <= reg) {
      cout << "NO\n";
      return 0;
    }
    if (maxx != -1) {
      ans.push_back(make_pair(tim, maxind + 1));
      m[maxind] = 1;
      damage += maxx;
    }
    health -= damage;
    health += reg;
    if (health > max) {
      health = max;
    }
    tim++;
  }
  cout << "YES\n";
  cout << tim << " " << ans.size() << endl;
  for (int i = 0; i < ans.size(); i++) {
    cout << ans[i].first << " " << ans[i].second << endl;
  }
}
