#include <iostream>
#include <string.h>
using namespace std;

int m,n,t;
int v[30],vi[30][30]; //v記錄目標， vi記錄可用選擇
int total,p[30],ni[30];
bool line[30];

bool check()
{
     for (int i = 0; i < m; i++)
         if(p[i] < v[i]) return false; //只要有一個不滿足就不行
     return true;
}

void search(int k,int depth)
{     
     if(check() && depth < total) //遞歸的結束控制
　　  {
         total = depth;
         t = 0;
         for (int i = 0; i < n; i++) 
             if(line[i]) ni[t++] = i+1; //記錄行號
         return;
     }
     for (int i = k+1;i < n; i++)
     {
        for (int j = 0; j < m; j++) 
             p[j]+=vi[i][j]; //再增加一排進行搜索
        line[i] = true;
        search(i,depth+1); //對應的depth要加1.
        for (int j = 0; j < m; j++) 
             p[j]-=vi[i][j]; //將p[j]復原
        line[i] = false;
     }
}

int main()
{  
    cin >> m;
    for (int i = 0; i < m; i++) 
        cin >> v[i];
    cin >> n;
    for (int i = 0; i < n; i++)
        for (int j = 0; j < m; j++) 
             cin >> vi[i][j];
    total = 100;
    memset(p,0,sizeof(p));
    memset(line,false,sizeof(line));    
    for (int i = 0; i < n; i++) //i表示第i+1排
    {
        for (int j = 0; j < m; j++) //j表示第j+1列
             p[j]+=vi[i][j]; //p[j]表示有i+1排時，第j列的和。
        line[i] = true; //將第i排標記為正在使用中
        search(i,1);
        for (int j = 0; j < m; j++) 
             p[j]-=vi[i][j]; //將p[j]復原
        line[i] = false;
    }
    cout << total <<" ";    
    t = 0;   
    for (int i = 0; i < total-1; i++) 
　 　cout << ni[i] <<" ";
    cout << ni[total-1] << endl;    
    return 0;
}