#include<fstream>
#include<algorithm>
#include<vector>
#include<queue>
#define INF 2000000000
using namespace std;

class Negot{
private:
    struct elem
    {
        int x,poz;
    };
    vector<elem>a[41005];
    elem tata[41005];
    int n,s,d,sol,r[500002];
    bool viz[41005];
    queue<int>q;
public:
    inline bool bfs()
    {
        int i,x,l;
        for(i=1;i<=n;i++)
            viz[i]=0,tata[i]={0,0};
        q.push(s);
        viz[s]=1;
        while(!q.empty())
        {
            x=q.front();
            q.pop();
            l=a[x].size();
            for(i=0;i<l;i++)
                if(viz[a[x][i].x]==0&&r[a[x][i].poz]>0)
                {
                    viz[a[x][i].x]=1;
                    tata[a[x][i].x].x=x;
                    tata[a[x][i].x].poz=a[x][i].poz;
                    q.push(a[x][i].x);
                }
        }
        return viz[d];
    }

    inline void flux_maxim()
    {
        int i,j,flow,l=a[d].size();
        while(bfs()!=0)
        {
            for(i=0;i<l;i++)
                if(tata[a[d][i].x].x!=0&&r[a[d][i].poz^1]>0)
                {
                    flow=r[a[d][i].poz^1];
                    for(j=a[d][i].x;j!=s;j=tata[j].x)
                    {
                        flow=min(flow,r[tata[j].poz]);
                        if(flow==0)
                            break;
                    }
                    if(flow!=0)
                    {
                        r[a[d][i].poz^1]-=flow;
                        r[a[d][i].poz]+=flow;
                        for(j=a[d][i].x;j!=s;j=tata[j].x)
                        {
                            r[tata[j].poz]-=flow;
                            r[tata[j].poz^1]+=flow;
                        }
                        sol+=flow;
                    }
                }
        }
    }
void solution(){

    ifstream f("negot.in");
    ofstream g("negot.out");
    int m,i,x,y,k=0,K,t,j;
    f>>n>>m>>K;
    for(i=1;i<=n;i++)
    {
        x=i;
        f>>t;
        for(j=1;j<=t;j++)
        {
            f>>y;
            y+=n;
            r[k]=1;
            a[x].push_back({y,k});
            k++;
            r[k]=0;
            a[y].push_back({x,k});
            k++;
        }
    }
    s=n+m+1;
    d=n+m+2;
    for(i=1;i<=n;i++)
    {
        r[k]=K;
        a[s].push_back({i,k});
        k++;
        r[k]=0;
        a[i].push_back({s,k});
        k++;
    }
    for(i=n+1;i<=n+m;i++)
    {
        r[k]=1;
        a[i].push_back({d,k});
        k++;
        r[k]=0;
        a[d].push_back({i,k});
        k++;
    }
    n=n+m+2;
    flux_maxim();
    g<<sol;
    }
};

class Cc{
private:
    struct nod
    {
        int x,poz;
    };
    vector<nod>a[205];
    nod tata[205];
    int n,s,d,flux,sol,r[20402],z[20402],dist[205],dist2[205],realdist[205];
    bool inq[205];
    queue<int>q;
    struct elem
    {
        int x,dist;
        inline bool operator < (const elem &a) const
        {
            return dist>a.dist;
        }
    };
    priority_queue<elem>pq;
public:

    inline bool dijkstra()
    {
        int i,l,Z;
        elem p;
        for(i=1;i<=n;i++)
            dist[i]=INF,tata[i]={0,0};
        pq.push({s,0});
        dist[s]=0;
        dist2[s]=0;
        while(!pq.empty())
        {
            p=pq.top();
            pq.pop();
            if(p.dist==dist[p.x])
            {
                l=a[p.x].size();
                for(i=0;i<l;i++)
                {
                    Z=realdist[p.x]-realdist[a[p.x][i].x]+z[a[p.x][i].poz];
                    if(r[a[p.x][i].poz]>0&&dist[a[p.x][i].x]>dist[p.x]+Z)
                    {
                        dist[a[p.x][i].x]=dist[p.x]+Z;
                        dist2[a[p.x][i].x]=dist2[p.x]+z[a[p.x][i].poz];
                        tata[a[p.x][i].x].x=p.x;
                        tata[a[p.x][i].x].poz=a[p.x][i].poz;
                        pq.push({a[p.x][i].x,dist[a[p.x][i].x]});
                    }
                }
            }
        }
        for(i=1;i<=n;i++)
            realdist[i]=dist2[i];
        return dist[d]!=INF;
    }

    inline void bellman_ford()
    {
        int i,l,p;
        for(i=1;i<=n;i++)
            realdist[i]=INF;
        realdist[s]=0;
        q.push(s);
        inq[s]=1;
        while(!q.empty())
        {
            p=q.front();
            q.pop();
            inq[p]=0;
            l=a[p].size();
            for(i=0;i<l;i++)
                if(r[a[p][i].poz]>0&&realdist[a[p][i].x]>realdist[p]+z[a[p][i].poz])
                {
                    realdist[a[p][i].x]=realdist[p]+z[a[p][i].poz];
                    if(inq[a[p][i].x]==0)
                    {
                        q.push(a[p][i].x);
                        inq[a[p][i].x]=1;
                    }
                }
        }
    }

    inline void fmcm()
    {
        int i,flow,cost;
        bellman_ford();
        while(dijkstra()!=0)
        {
            flow=INF;
            for(i=d;i!=s;i=tata[i].x)
            {
                flow=min(flow,r[tata[i].poz]);
                if(flow==0)
                    break;
            }
            if(flow!=0&&flow!=INF)
            {
                cost=0;
                for(i=d;i!=s;i=tata[i].x)
                {
                    r[tata[i].poz]-=flow;
                    r[tata[i].poz^1]+=flow;
                    cost+=z[tata[i].poz];
                }
                flux+=flow;
                sol+=flow*cost;
            }
        }
    }

    void solution()
    {
        ifstream f("cc.in");
        ofstream g("cc.out");
        int i,x,k=0,j;
        f>>n;
        s=2*n+1;
        d=2*n+2;
        for(i=1;i<=n;i++)
            for(j=1;j<=n;j++)
            {
                f>>x;
                r[k]=1;
                z[k]=x;
                a[i].push_back({j+n,k});
                k++;
                r[k]=0;
                z[k]=-x;
                a[j+n].push_back({i,k});
                k++;
            }
        for(i=1;i<=n;i++)
        {
            r[k]=1;
            z[k]=0;
            a[s].push_back({i,k});
            k++;
            r[k]=0;
            z[k]=0;
            a[i].push_back({s,k});
            k++;
            r[k]=1;
            z[k]=0;
            a[i+n].push_back({d,k});
            k++;
            r[k]=0;
            z[k]=0;
            a[d].push_back({i+n,k});
            k++;
        }
        n=n*2+2;
        fmcm();
        g<<sol;
    }
};

int main()
{
//    Negot n;
//    n.solution();
Cc c;
c.solution();

    return 0;
}