#include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
const int maxn = 100010;
int n;
multiset<int> open;
long long x, y;
void add(long long& a, long long b) { a = (a + b) % mod; }
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long ans = 0LL;
  cin >> n >> x >> y;
  vector<pair<int, int> > events;
  int l, r;
  for (int i = 0; i < n; i++) {
    cin >> l >> r;
    add(ans, (r - l) * y);
    events.push_back(pair<int, int>(l, 1));
    events.push_back(pair<int, int>(r + 1, 0));
  }
  sort(events.begin(), events.end());
  for (pair<int, int> val : events) {
    int spot = val.first;
    int tp = val.second;
    if (tp == 0) {
      open.insert(spot);
    } else {
      if (open.size()) {
        int fg = *(open.rbegin());
        long long o1 = (spot - fg + 1LL) * y;
        add(ans, min(o1, x));
        open.erase(open.find(fg));
      } else {
        add(ans, x);
      }
    }
  }
  cout << ans << endl;
}
