int n,p,h,m,a[N],x,y;
int main(){cin>>n>>p>>h>>m;
for(int i=1;i<=n;i++)a[i]=h;
while(m--){
cin>>x>>y;
if(x>y)swap(x,y);
if(x+1==y)continue;
int k=min(a[x],a[y]);
bool flag=false;
for(int i=x+1;i<=y-1;i++)
return 0;
}                 ```