#include <bits/stdc++.h>
using namespace std;
vector<pair<long long int, long long int> > v;
set<pair<long long int, long long int> > s;
long long a[100005];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long n, x, y, x1, y1;
  cin >> n >> x >> y;
  for (int i = 1; i <= n; i++) {
    cin >> x1 >> y1;
    v.push_back(make_pair(x1, y1));
  }
  sort((v).begin(), (v).end());
  s.insert(make_pair(v[0].second, 1));
  a[1] = v[0].second;
  long long ans = x + (v[0].second - v[0].first) * y;
  int cnt = 1;
  long long c, d;
  set<pair<long long int, long long int> >::iterator it;
  for (int i = 1; i < v.size(); i++) {
    it = s.lower_bound({v[i].first, -1000000007});
    if (it != s.begin()) {
      it--;
      c = it->first;
      d = it->second;
      if ((v[i].first - c) * y < x && a[d] <= c) {
        s.erase(it);
        s.insert(make_pair(v[i].second, d));
        a[d] = v[i].second;
        ans += (v[i].second - c) * y;
      } else {
        cnt++;
        s.insert(make_pair(v[i].second, cnt));
        a[cnt] = v[i].second;
        ans += (x + y * (v[i].second - v[i].first));
      }
    } else {
      cnt++;
      s.insert(make_pair(v[i].second, cnt));
      a[cnt] = v[i].second;
      ans += (x + y * (v[i].second - v[i].first));
    }
    ans %= 1000000007;
  }
  cout << ans;
}
