#include <bits/stdc++.h>
using namespace std;
int main() {
  long long t, n, x, y, i, ans = 0, l, r, tv = 0, cur = 0;
  cin >> n >> x >> y;
  vector<pair<long long, long long> > v(n);
  for (i = 0; i < n; i++) {
    cin >> v[i].first >> v[i].second;
    ans = (ans + (y * (v[i].second - v[i].first)) % 1000000007) % 1000000007;
  }
  sort((v).begin(), (v).end());
  long long cnt = 0;
  set<pair<long long, long long> > s;
  for (pair<long long, long long> pi : v) {
    cnt++;
    if (s.empty()) {
      s.insert(make_pair(pi.second, cnt));
      ans = (ans + x) % 1000000007;
    } else {
      auto it = s.lower_bound(make_pair(pi.first, 0));
      if (it != s.begin()) {
        it--;
        long long val1 = y * (pi.first - it->first);
        if (val1 <= x) {
          s.erase(it);
          ans = (ans + val1 % 1000000007) % 1000000007;
        } else
          ans = (ans + x) % 1000000007;
        s.insert(make_pair(pi.second, cnt));
      } else {
        s.insert(make_pair(pi.second, cnt));
        ans = (ans + x) % 1000000007;
      }
    }
  }
  cout << ans;
  return 0;
}
