#include <bits/stdc++.h>
#include <cstdio>
using namespace std;
#define ll long long int
#define ull unsigned long long int
#define forn(a,b) for(int a=0; a<b; a++)
#define FOR(a,b) for(int a=1; a<=b; a++)
#define getmax(a,b) ((a)>(b)?(a):(b))
#define mp(a,b) make_pair(a,b)
#define vi vector<int>
#define vull vector<unsigned long long int>
#define vll vector<long long int>
#define vp vector<pair<int,int>>
#define vs vector<string>
#define pb push_back
#define s(a) sort(a.begin(),a.end())
#define sr(a) sort(a.rbegin(),a.rend())
int z=1e9+7;
int arr[20001],arr1[200010];
// find the number of digit in an integer : floor(log10(n))+1
/*vector<pair<int,int>>vec;
vec.push_back({2,3});
vec.push_back({3,2});
sort(vec.rbegin(),vec.rend());
cout << vec[0].first<<" "<<vec[0].second <<endl;
cout << vec[1].first<<" "<<vec[1].second <<endl;
*/
/*for (auto it = v.begin(); it != v.end(); ++it) { // for map<ll,vector<ll>>qweqwe
cout << "Key: " << it->first << ", Values: ";
for (auto val : it->second) {
cout << val << " ";
}
cout << endl;
}*/
/*for (auto& iter: s) { // for map<int,int>qweqwe
std::cout << iter.first << ": " << iter.second << std::endl;
}*/
/*int factorial(ull y)
{
if(y<=1)return 1;
else return y*factorial(y-1);
}
void setIO(string n)
{
freopen((n+".in").c_str(),"r",stdin);
freopen((n+".out").c_str(),"w",stdout);
}
*/
int N;
vi H;
void init(int N, vi H)
{
int n,h;
cin>>n>>h;
forn(i,h){
int x;
cin>>x;
H.pb(x);
}
int a,b,c,d;
cin>>a>>b>>c>>d;
}
int minimum_jumps(int A, int B, int C, int D){
return C-B;
}
int xmain()
{
//setIO("input");
ios::sync_with_stdio(0);
return 0;
}
