#include <iostream>
#include <cstdio>
#include <algorithm>
const int nmax=35;
using namespace std;
int need[nmax],n,m,Minl;
int VTM[nmax][nmax],ans=0;
int main()
{
    int i,j,k;
    freopen("holstein.in","r",stdin);
    freopen("holstein.out","w",stdout); 
    scanf("%d",&n);
    for(i=1;i<=n;i++) 
		scanf("%d",&need[i]);
    scanf("%d",&m);
    for(i=1;i<=m;i++)
		for (j=1;j<=n;j++) 
			scanf("%d",&VTM[i][j]);
    Minl=0x7fffffff;
    for(i=1;i<=(1<<m)-1;i++)
    {
        int count=0,total[nmax]={0};
        for(k=0;k<m;k++) 
			if(((1<<k)&i)==(1<<k)) 
				count++;
        if(count>Minl) 
			continue;
        for(k=0;k<m;k++) 
			if(((1<<k)&i)==(1<<k)) 
				for(j=1;j<=n;j++)
					total[j]+=VTM[k+1][j];
        for(j=1;j<=n;j++) 
			if(total[j]<need[j]) 
				continue;
        if((count<Minl)||((count==Minl)&&(ans>i))) 
		{
			ans=i;
			Minl=count;
		}
    }
    printf("%d ",Minl);
    for(k=0;k<m;k++) 
		if(((1<<k)&ans)==(1<<k))
			printf("%d ",k+1);
    return 0;
}