#include <bits/stdc++.h> using namespace std; int n,h,k; int x[200005],d[200005]; int X,D; priority_queue <int> q; double ans; int main () { scanf("%d%d%d",&n,&h,&k); for (int i = 1;i <= n;i++) { scanf("%d",&x[i]); } for (int i = 1;i <= n;i++) { scanf("%d",&d[i]); if (d[i] == -1) { q.push(x[i]); } } while (q.size() > h) { q.pop(); } for (int i = 1;i <= k;i++) { scanf("%d%d",&X,&D); if (D == -1) { q.push(X); } if (q.size() > h) { q.pop(); } if (q.size() < h) { printf("Zombie ate your brain\n"); continue; } ans = q.top(); ans /= 2; printf("%.1f\n",ans); } return 0; }