#include <bits/stdc++.h>
using namespace std;
vector<pair<long long, long long> > v;
multiset<long long> mp;
long long i, j, k, n, x, z, ans, c1, c2;
int main() {
  std::ios_base::sync_with_stdio(false);
  cin.tie(0);
  cin >> n >> x >> z;
  for (i = 0; i < n; i++) {
    cin >> c1 >> c2;
    v.push_back(make_pair(c1, c2));
  }
  sort(v.begin(), v.end());
  for (i = 0; i < n; i++) {
    if (!mp.empty()) {
      auto it = mp.lower_bound(v[i].first);
      if (*it >= v[i].first) it--;
      if ((v[i].first - *it) * z <= x && *it < v[i].first) {
        ans += (v[i].second - *it) * z;
        mp.erase(it);
      } else
        ans += x + (v[i].second - v[i].first) * z;
    } else
      ans += x + (v[i].second - v[i].first) * z;
    ans %= 1000000007;
    mp.insert(v[i].second);
  }
  cout << ans << endl;
  return 0;
}
