#include<iostream>
#include<cmath>
#include<algorithm>
#include<climits>
#define ll long long
using namespace std;
int main(){
int n, h, a, b, k;
cin>>n>>h>>a>>b>>k;
while(k--){
int floor[4];
for(int i=0; i<4; i++){
cin>>floor[i];
}
if(floor[0]==floor[2]){
cout<<abs(floor[3]-floor[1])<<endl;
}
else{
int count=abs(floor[2]-floor[0]);
if(floor[1]>=a && floor[1]<=b){
cout<<count+abs(floor[3]-floor[1])<<endl;
}
else if(floor[1]<a){
cout<<abs(floor[1]-a)+count+abs(a-floor[3])<<endl;
}
else if(floor[1]>b){
cout<<abs(floor[1]-b)+count+abs(floor[3]-b)<<endl;
}
}
}
return 0;
}
17. Letter Combinations of a Phone Number | 5. Longest Palindromic Substring |
3. Longest Substring Without Repeating Characters | 1312. Minimum Insertion Steps to Make a String Palindrome |
1092. Shortest Common Supersequence | 1044. Longest Duplicate Substring |
1032. Stream of Characters | 987. Vertical Order Traversal of a Binary Tree |
952. Largest Component Size by Common Factor | 212. Word Search II |
174. Dungeon Game | 127. Word Ladder |
123. Best Time to Buy and Sell Stock III | 85. Maximal Rectangle |
84. Largest Rectangle in Histogram | 60. Permutation Sequence |
42. Trapping Rain Water | 32. Longest Valid Parentheses |
Cutting a material | Bubble Sort |
Number of triangles | AND path in a binary tree |
Factorial equations | Removal of vertices |
Happy segments | Cyclic shifts |
Zoos | Build a graph |
Almost correct bracket sequence | Count of integers |