#include <bits/stdc++.h>
#pragma GCC optimize("Ofast", "unroll-loops", "no-stack-protector")
using namespace std;
int32_t main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long test = 1;
  while (test--) {
    long long n, x, y;
    cin >> n >> x >> y;
    vector<pair<long long, long long>> v(n + 1);
    multiset<pair<pair<long long, long long>, long long>> s;
    for (long long i = 1; i <= n; i++) {
      cin >> v[i].first >> v[i].second;
      s.insert({{v[i].second, v[i].first}, i});
    }
    sort(v.begin() + 1, v.end());
    long long ans = 0;
    for (long long i = 1; i <= n; i++) {
      ans = ans % 1000000007;
      long long temp = (x + y * (v[i].second - v[i].first));
      if (s.size() == 0 || s.begin()->first.first >= v[i].first) {
        ans += temp;
        continue;
      }
      auto it = s.lower_bound({{v[i].first, 0}, 0});
      it--;
      long long pr = (it->first.first);
      if (y * (v[i].second - pr) >= temp) {
        ans += temp;
        continue;
      }
      temp = y * (v[i].second - pr);
      s.erase(it);
      ans += temp;
    }
    cout << ans % 1000000007 << endl;
  }
  cerr << endl
       << "Time: " << (clock() * 1000. / CLOCKS_PER_SEC) << " ms" << endl;
  return 0;
}
