#include <bits/stdc++.h>
using namespace std;
set<pair<long long, long long>> s;
vector<pair<long long, long long>> am[100100];
const long long MOD = 1e9 + 7;
pair<long long, long long> v[100100];
int main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int n;
  cin >> n;
  long long x, y;
  cin >> x >> y;
  for (int i = 1; i <= n; i++) {
    cin >> v[i].first >> v[i].second;
  }
  sort(v + 1, v + n + 1);
  int cont = 0;
  for (int i = 1; i <= n; i++) {
    auto it = s.upper_bound({-v[i].first, n});
    pair<int, int> now = *it;
    if (!now.second) {
      cont++;
      am[cont].push_back(v[i]);
      s.insert({-v[i].second, cont});
    } else {
      s.erase(it);
      am[now.second].push_back(v[i]);
      s.insert({-v[i].second, now.second});
    }
  }
  long long ans = 0;
  for (int i = 1; i <= cont; i++) {
    long long now = 0;
    for (int j = 0; j < (int)am[i].size(); j++) {
      if (j && y * (am[i][j].first - am[i][j - 1].second) < x) {
        now += y * (am[i][j].first - am[i][j - 1].second);
        now %= MOD;
      } else {
        now += x;
        now %= MOD;
      }
      now += y * (am[i][j].second - am[i][j].first);
      now %= MOD;
    }
    ans += now;
    ans %= MOD;
  }
  cout << ans;
  return 0;
}
