#include <bits/stdc++.h> #define int long long using namespace std; int n,h,k; int x[400005],d[400005]; int sum=0; priority_queue<int> q; signed main(){ cin>>n>>h>>k; for (int i=1;i<=n;i++){ cin>>x[i]; } for (int i=1;i<=n;i++){ cin>>d[i]; if (d[i]==-1){ sum++; q.push(x[i]); } } while (k--){ int lx,ld; cin>>lx>>ld; if (ld==-1) sum++; if (sum<h){ cout<<"Zombie ate your brain"<<endl; continue; } if (ld==-1){ q.push(lx); } while (q.size()>h){ q.pop(); } int s=q.top(); if (s%2==0){ cout<<s/2<<".0"<<endl; } else{ cout<<s/2<<".5"<<endl; } } return 0; }