#include<cstring>

 #include<cstdio>

 #include<algorithm>

 #include<iostream>

 #include<algorithm>

 #define N 57

 #define M 50007

 #define ll long long

 using namespace std;

 inline int read()

 {

     int x=,f=;char ch=getchar();

     while(!isdigit(ch)){if(ch=='-')f=-;ch=getchar();}

     while(isdigit(ch)){x=(x<<)+(x<<)+ch-'';ch=getchar();}

     return x*f;

 }

 int m,b,n;

 int a[M],h[N<<],map[N][M];

 int ans[N<<],mmin;

 struct node

 {

     int a,c1,c2,cha,s;

 }s[M];

 bool cmp(node n1,node n2) {return n1.cha>n2.cha;}

 int main()

 {

     m=read(),b=read(),h[]=read(),n=read();

     for(int i=;i<=m;i++) a[i]=read();

     for(int i=;i<=n;i++) h[i]=read();

     for(int i=;i<=n;i++)

         for(int j=;j<=m;j++)

             map[i][j]=read();

     mmin=;

     for(int i=;i<=n;i++)

     {

         for(int j=;j<=m;j++) {s[j].s=a[j];s[j].a=a[j];s[j].c1=map[][j];s[j].c2=map[i][j];s[j].cha=map[i][j]-map[][j];}

         sort(s+,s++m,cmp);int t=b,sum=;

         for(int j=;j<=m;j++)

         {

             if(t!=)

             {

                 if(t>=s[j].s) {t-=s[j].s;sum+=s[j].s*s[j].c1;}

                 else {sum+=t*s[j].c1+(s[j].s-t)*s[j].c2;t=;}

             }else sum+=s[j].s*s[j].c2;

         }

         ans[i]=sum+h[]+h[i];mmin=min(mmin,ans[i]);

     }

     for(int i=;i<=n;i++)

         if(ans[i]==mmin)

             {printf("%d\n%d\n",i,ans[i]);return ;}

 }