#include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
const int N = 100010;
pair<int, int> a[N];
multiset<int> st;
int main() {
  int n, first, second;
  scanf("%d%d%d", &n, &first, &second);
  for (int i = 1; i <= n; i++) scanf("%d%d", &a[i].first, &a[i].second);
  sort(a + 1, a + n + 1);
  long long ans = 0;
  for (int i = 1; i <= n; i++) {
    if (st.empty()) {
      ans += first + 1LL * (a[i].second - a[i].first) * second;
      ans %= mod;
    } else {
      multiset<int>::iterator it = st.lower_bound(a[i].first);
      if (it == st.begin()) {
        ans += first + 1LL * (a[i].second - a[i].first) * second;
        ans %= mod;
      } else {
        it--;
        long long cost = first + 1LL * (a[i].second - a[i].first) * second;
        long long cost2 = 1LL * (a[i].second - *it) * second;
        if (cost <= cost2)
          ans += cost;
        else
          ans += cost2, st.erase(it);
        ans %= mod;
      }
    }
    st.insert(a[i].second);
  }
  cout << ans << endl;
  return 0;
}
