#include <bits/stdc++.h>
#define SZ(v) ((int)(v).size())
using namespace std;
using ll = long long;
template<typename... Args>
void read(Args&... args)
{
((cin >> args), ...);
}
template<typename T>
void read(vector<T> &vec)
{
for (auto &v : vec) read(v);
}
void write() {}
template<typename H, typename... T>
void write(const H &h, const T&... t)
{
cout << h;
if (sizeof...(t)) {cout << ' '; write(t...);}
}
template<typename T>
void write(const vector<T> &vec)
{
if (SZ(vec) == 0) return;
write(vec[0]);
for (int i(1); i < SZ(vec); ++i)
{cout << ' '; write(vec[i]);}
}
template<typename... Args>
void writeln(Args... args)
{
write(args...); cout << '\n';
}
void show(__int128 x)
{
if (x >= 10)
show(x/10);
cout << int(x%10);
}
int main(void)
{
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
int n;
ll _A, _B;
using T = __int128;
read(n, _A, _B);
T A(_A), B(_B);
T mod = (A * B) / gcd(_A, _B+1);
vector<pair<T, T>> intervals;
for (int i(0); i < n; ++i)
{
ll _l, _r;
read(_l, _r);
T l(_l), r(_r);
l %= mod, r %= mod;
if (_r-_l+1 >= mod)
intervals.emplace_back(0, mod-1);
else if (l > r)
{
intervals.emplace_back(l, mod-1);
intervals.emplace_back(0, r);
}
else
intervals.emplace_back(l, r);
}
sort(intervals.begin(), intervals.end());
T lst(-1);
T sol(0);
for (auto [l, r] : intervals)
{
sol += max(T(0), r - max(l, lst+1) + 1);
lst = max(lst, r);
}
show(sol);
cout << endl;
}
