#include <bits/stdc++.h>
using namespace std;
template <class T>
inline T bigMod(T p, T e, T M) {
  long long ret = 1;
  for (; e > 0; e >>= 1) {
    if (e & 1) ret = (ret * p) % M;
    p = (p * p) % M;
  }
  return (T)ret;
}
template <class T>
inline T modInverse(T a, T M) {
  return bigMod(a, M - 2, M);
}
template <class T>
inline T gcd(T a, T b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
template <class T>
inline T lcm(T a, T b) {
  a = abs(a);
  b = abs(b);
  return (a / gcd(a, b)) * b;
}
template <class T>
inline string int2String(T a) {
  ostringstream str;
  str << a;
  return str.str();
}
template <class T>
inline T string2int(string a) {
  stringstream str(a);
  T b;
  str >> b;
  return b;
}
const int dr[] = {0, 1, 0, -1, -1, 1, 1, -1, -2, -2, 2, 2, -1, -1, 1, 1};
const int dc[] = {1, 0, -1, 0, 1, 1, -1, -1, -1, 1, -1, 1, -2, 2, -2, 2};
int main() {
  int n, h, a, b, k;
  scanf("%d %d", &n, &h), scanf("%d %d", &a, &b), scanf("%d", &k);
  while (k--) {
    int t1, t2, f1, f2;
    scanf("%d %d", &t1, &f1), scanf("%d %d", &t2, &f2);
    if (t1 == t2) {
      printf("%d\n", abs(f1 - f2));
    } else {
      int ans = abs(t2 - t1);
      if (f1 >= a && f1 <= b)
        ans += abs(f2 - f1);
      else if (f1 > b) {
        ans += f1 - b;
        ans += abs(b - f2);
      } else {
        ans += a - f1;
        ans += abs(a - f2);
      }
      printf("%d\n", ans);
    }
  }
  return 0;
}
