#include<iostream>

#include<cstdio>

#include<cstring>

#include<algorithm>

#include<cmath>

#define eps 1e-6

using namespace std;

int const maxn=;

typedef long double ld;

int n,m,cnt,ans;

struct N{ld a[maxn]; int w;}t[maxn],p[maxn];

bool vis[maxn];

bool cmp(N x,N y){return x.w<y.w;}

void solve()

{

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

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

        {

            if(fabs(t[i].a[j])<eps)continue;

            if(!vis[j])

            {

                vis[j]=;

                p[j]=t[i];//j位置的装备

                cnt++;

                ans+=t[i].w;

                break;

            }

            else//被消元

            {

                ld k=t[i].a[j]/p[j].a[j];

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

                    t[i].a[l]-=k*p[j].a[l];

            }

        }

}

int main()

{

    scanf("%d%d",&n,&m);

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

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

            scanf("%Lf",&t[i].a[j]);//%Lf!!

    for(int i=;i<=n;i++)scanf("%d",&t[i].w);

    sort(t+,t+n+,cmp);

    solve();

    printf("%d %d",cnt,ans);

    return ;

}