AC

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

const int mod = 2027;

int main() {
    int n, m;
    cin >> n >> m;
    int N = n + 1;

    int ans[N];
    memset(ans, 0, sizeof(ans));
    ans[1] = 1;

    int mat[N][N];
    memset(mat, 0, sizeof(mat));

    mat[0][0] = 1;
    for (int i = 1; i < N; i++) {
        mat[i][0] = 1;
        mat[i][i] = 1;
    }

    for (int i = 0; i < m; i++) {
        int u, v;
        cin >> u >> v;
        mat[u][v] = 1;
        mat[v][u] = 1;
    }

    int t;
    cin >> t;

    int t2[N];
    int t1[N][N];

    while (t) {
        if (t & 1) {
            memset(t2, 0, sizeof(t2));
            for (int i = 0; i < N; i++) {
                for (int j = 0; j < N; j++) {
                    t2[j] = (t2[j] + ans[i] * mat[i][j]) % mod;
                }
            }
            for (int i = 0; i < N; i++) {
                ans[i] = t2[i];
            }
        }

        memset(t1, 0, sizeof(t1));
        for (int i = 0; i < N; i++) {
            for (int j = 0; j < N; j++) {
                for (int k = 0; k < N; k++) {
                    t1[i][j] = (t1[i][j] + mat[i][k] * mat[k][j]) % mod;
                }
            }
        }
        for (int i = 0; i < N; i++) {
            for (int j = 0; j < N; j++) {
                mat[i][j] = t1[i][j];
            }
        }

        t >>= 1;
    }

    int sum = 0;
    for (int i = 0; i < N; i++) {
        sum = (sum + ans[i]) % mod;
    }
    cout << sum << endl;

    return 0;
}