#include <iostream>
#include <vector>

using namespace std;

const int INF = 1e9;

int main() {
    int n, m, k;
    cin >> n >> m >> k;

    vector<vector<int>> dp(n + 1, vector<int>(k + 1, INF));
    dp[1][0] = 0;

    for (int i = 0; i < m; ++i) {
        int a, b;
        cin >> a >> b;
    }

    for (int day = 1; day <= k; ++day) {
        for (int room = 1; room <= n; ++room) {
            for (int i = 0; i < m; ++i) {
                int a, b;
                cin >> a >> b;

                if (room == a) {
                    dp[b][day] = min(dp[b][day], dp[a][day - 1] + 1);
                } else if (room == b) {
                    dp[a][day] = min(dp[a][day], dp[b][day - 1] + 1);
                }
            }
        }
    }

    if (dp[n][k] == INF) {
        cout << -1 << endl;
    } else {
        cout << dp[n][k] << endl;
    }

    return 0;
}

#include <bits/stdc++.h>
using namespace std;
int n,m,k,a,b;
int main() {
    
    cin>>n>>m>>k;
    vector<int> r(k+1,1);  
    for (int i=0;i<m;i++) {
        cin>>a>>b;
    }

    if (n>1&&k<n-1) {
        cout<<-1<<endl;
    } else {
        cout<<k<<endl;
        for (int i=0;i<k;i++) {
            cout<<"1 ";
        }
        cout<<endl;
    }

    return 0;
}