#include <cstdio>
#define NMAX 200
using namespace std;
int a[NMAX+5][NMAX+5],v[NMAX+5][NMAX+5],ok,n,m;
int funct(int i,int j)
{
	int s=0;
	if(i<n&&j<=m)
	{
	if(v[i][j]<v[i+1][j])
		s=v[i+1][j]-v[i][j];
	else
		s=v[i][j]-v[i+1][j];
	if(a[i][j]-s>0)
		{
			a[i+1][j]=a[i][j]-s;
			funct(i+1,j);
		}
	if(v[i][j]<v[i+1][j-1])
		s=v[i+1][j-1]-v[i][j];
	else
		s=v[i][j]-v[i+1][j-1];
	if(a[i][j]-s>0)
		{
			a[i+1][j-1]=a[i][j]-s;
			funct(i+1,j-1);
		}
	if(v[i][j]<v[i+1][j+1])
		s=v[i+1][j+1]-v[i][j];
	else
		s=v[i][j]-v[i+1][j+1];
	if(a[i][j]-s>0)
		{
			a[i+1][j+1]=a[i][j]-s;
			funct(i+1,j+1);
		}
	}
}
int main()
{
	int i,p,j,semn=0,i1,j1;
    freopen("robot.in","r",stdin);
    freopen("robot.out","w",stdout);
    scanf("%d %d %d",&p,&n,&m);
    for(i=1;i<=n;i++)
		for(j=1;j<=m;j++)
		scanf("%d",&v[i][j]);
	for(j=1;j<=m;j++)
	{
		i=1;
		a[1][j]=p;
		for(i1=2;i1<=n;i1++)
            for(j1=1;j1<=m;j1++)
            a[i1][j1]=0;
		ok=0;
		funct(i,j);
		for(i=1;i<=m;i++)
        if(a[n][i]>0)
            ok=1;
		if(ok==1)
			{
				printf("%d ",j);
				semn=1;
			}
	}
	if(semn!=1)
	printf("-1");
    return 0;
}