#include using namespace std; typedef long long ll; typedef pair P; #define REP(i,n) for(ll i=0;i> N >> Q >> S >> T >> C; while(Q--){ ll U,V; cin >> U >> V; ll d=-1; if(U<=V){ d=V-U; if(U<=S && T<=V) d=min(d,S-U+V-T+C); } else{ d=V+N-U; ll x; if(S-U<0) x=S+N-U; else x=S-U; ll y; if(V-T<0) y=V+N-T; else y=V-T; d=min(d,x+y+C); } cout << d << endl; } return 0; }