#include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
const long long inf = 1000000000000;
pair<long long, long long> a[100010];
long long cost[100010];
multiset<pair<pair<long long, long long>, long long> > s;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long n, x, y;
  cin >> n >> x >> y;
  long long ans = 0;
  for (int i = 1; i <= n; i++) {
    cin >> a[i].first >> a[i].second;
    s.insert(make_pair(make_pair(a[i].second, a[i].first), i));
  }
  sort(a + 1, a + n + 1);
  for (int i = 1; i <= n; i++) {
    cost[i] = (x + y * (a[i].second - a[i].first));
    if (!s.size() || s.begin()->first.first >= a[i].first) {
      continue;
    }
    auto it = s.lower_bound({{a[i].first, 0}, 0});
    long long pR = (--it)->first.first;
    if (y * (a[i].second - pR) >= cost[i]) {
      continue;
    }
    cost[i] = y * (a[i].second - pR);
    s.erase(it);
  }
  for (int i = 1; i <= n; i++) {
    ans += cost[i];
    ans %= mod;
  }
  cout << ans << '\n';
  return 0;
}
