/*#pragma GCC optimize("Ofast")
#pragma GCC optimize("avx2")
#pragma GCC optimize("unroll-loops")*/

#define ll int64_t

#include<bits/stdc++.h>
using namespace std;

const ll MAXN=1e3+5,mod=1e9+7;
ll n,m,g,cost[201][2001],par[201],rp[2001],gr[MAXN],cnt[MAXN],dist[201];
pair<pair<ll,ll>,ll> d[MAXN];
vector<pair<ll,ll>> v[201];
bool f[201];

void solve(){
    cin>>n>>m>>g;
    for(ll i=1;i<=g;i++){cin>>d[i].first.second; d[i].second=i; gr[i]=d[i].first.second; cnt[d[i].first.second]++;}
    for(ll i=1;i<=n;i++) for(ll j=1;j<=2000;j++) cin>>cost[i][j];
    ll p,q,w;
    for(ll i=0;i<m;i++){
        cin>>p>>q>>w;
        v[p].push_back({q,w});
        v[q].push_back({p,w});
    }

    for(ll i=2;i<=n;i++) dist[i]=LLONG_MAX;
    set<pair<ll,ll> > s;
    s.insert({0,1});
    ll k,td;
    while(!s.empty()){
        k=s.begin()->second;
        td=s.begin()->first;
        s.erase(s.begin());
        if(f[k]) continue;
        f[k]=1;
        for(auto ch : v[k]){
            if(f[ch.first]==0 && td+ch.second<dist[ch.first]){
                par[ch.first]=k;
                dist[ch.first]=td+ch.second;
                s.insert({dist[ch.first],ch.first});
            }
        }
    }



    ll anscnt=0;
    for(ll i=1;i<=n;i++){
        anscnt+=cnt[i]/4;
        if(cnt[i]%4!=0) anscnt++;
    }

    for(ll i=1;i<=n;i++){
        rp[i]=1999;
        for(ll j=1;j<2000;j++) if(cost[i][j]<cost[i][j+1]){rp[i]=j; break;}
    }
    for(ll i=1;i<=g;i++) d[i].first.first=rp[d[i].first.second];
    sort(d+1,d+1+g);
    ll pos=min(2000-anscnt+3,max((ll)0,d[1].first.first-cnt[gr[d[1].second]]/8));

    cout<<anscnt<<'\n';
    stack<ll> path;
    for(ll i=1;i<=g;i++){
        if(i!=1 && gr[d[i].second]!=gr[d[i-1].second]) pos=max(pos,min(2000-anscnt+i/4+8,max((ll)0,d[i].first.first-cnt[gr[d[i].second]]/8)));
        ll t=gr[d[i].second];
        while(t!=0){
            path.push(t);
            t=par[t];
        }

        if(gr[d[i].second]==gr[d[i+3].second]){
            cout<<pos<<" "<<4<<" "<<path.size()<<'\n';
            cout<<d[i].second<<" "<<d[i+1].second<<" "<<d[i+2].second<<" "<<d[i+3].second<<'\n';
            while(!path.empty()){
                cout<<path.top()<<" ";
                path.pop();
            }
            cout<<'\n';
            i+=3;
            pos++;
        }
        else if(gr[d[i].second]==gr[d[i+2].second]){
            cout<<pos<<" "<<3<<" "<<path.size()<<'\n';
            cout<<d[i].second<<" "<<d[i+1].second<<" "<<d[i+2].second<<'\n';
            while(!path.empty()){
                cout<<path.top()<<" ";
                path.pop();
            }
            cout<<'\n';
            i+=2;
            pos++;
        }
        else if(gr[d[i].second]==gr[d[i+1].second]){
            cout<<pos<<" "<<2<<" "<<path.size()<<'\n';
            cout<<d[i].second<<" "<<d[i+1].second<<'\n';
            while(!path.empty()){
                cout<<path.top()<<" ";
                path.pop();
            }
            cout<<'\n';
            i++;
            pos++;
        }
        else{
            cout<<pos<<" "<<1<<" "<<path.size()<<'\n';
            cout<<d[i].second<<'\n';
            while(!path.empty()){
                cout<<path.top()<<" ";
                path.pop();
            }
            cout<<'\n';
            pos++;
        }
    }
}

int main()
{
    freopen("transport.in","r",stdin); freopen("transport.out","w",stdout);

    ios_base::sync_with_stdio(false); cin.tie(NULL);

    ll t=1;
    //cin>>t;
    while(t--) solve();

    return 0;
}