#include <bits/stdc++.h>
using namespace std;
inline long long read() {
  long long x = 0, f = 1, ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = x * 10 + ch - '0';
    ch = getchar();
  }
  return x * f;
}
inline void write(long long x) {
  if (x < 0) putchar('-'), x = -x;
  if (x >= 10) write(x / 10);
  putchar(x % 10 + '0');
}
inline void writeln(long long x) {
  write(x);
  puts("");
}
const long long mod = 1e9 + 7, N = 1e5 + 5;
struct node {
  long long l, r;
} a[N];
long long ans, n, x, y;
multiset<long long> st;
multiset<long long>::iterator it;
inline void init() {
  n = read();
  x = read();
  y = read();
  for (long long i = 1; i <= n; i++) a[i] = (node){read(), read()};
}
inline bool cmp(node A, node B) { return (A.l == B.l) ? A.r < B.r : A.l < B.l; }
inline void solve() {
  st.insert(mod);
  st.insert(-mod);
  sort(a + 1, a + 1 + n, cmp);
  for (long long i = 1; i <= n; i++) {
    it = (--st.lower_bound(a[i].l));
    long long now = (*it), t1 = (a[i].r - now) * y,
              t2 = x + (a[i].r - a[i].l) * y;
    if (it == st.begin() || t1 > t2) {
      (ans += t2) %= mod;
    } else {
      (ans += t1) %= mod;
      st.erase(it);
    }
    st.insert(a[i].r);
  }
  writeln(ans);
}
signed main() {
  init();
  solve();
  return 0;
}
