/** author: shobonvip created: 2026.11.14 09:20:26 **/ #include using namespace std; //* ATCODER #include using namespace atcoder; typedef modint998244353 mint; //*/ /* BOOST MULTIPRECISION #include using namespace boost::multiprecision; //*/ typedef long long ll; #define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++) #define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--) #define all(v) v.begin(), v.end() template bool chmin(T &a, const T &b) { if (a <= b) return false; a = b; return true; } template bool chmax(T &a, const T &b) { if (a >= b) return false; a = b; return true; } template T max(vector &a){ assert(!a.empty()); T ret = a[0]; for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]); return ret; } template T min(vector &a){ assert(!a.empty()); T ret = a[0]; for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]); return ret; } template T sum(vector &a){ T ret = 0; for (int i=0; i<(int)a.size(); i++) ret += a[i]; return ret; } int main(){ ios_base::sync_with_stdio(false); cin.tie(NULL); int n,q,s,t; ll c; cin >> n >> q >> s >> t >> c; s--; t--; auto dist = [&](int i, int j) -> ll { if (i<=j) return j-i; else return j+n-i; // return min(abs(i-j), abs(j+n-i)); }; rep(i,0,q) { int u, v; cin >> u >> v; u--; v--; ll ans = 1e18; chmin(ans, dist(u,v)); chmin(ans, dist(u,s) + c + dist(t,v)); cout << ans << '\n'; } }