#include "bits/extc++.h"

using namespace std;

template <typename T, typename... U>
void dbgh(const T& t, const U&... u) {
    cerr << t;
    ((cerr << " | " << u), ...);
    cerr << endl;
}

#ifdef DEBUG
#define dbg(...)                                           \
    cerr << "L" << __LINE__ << " [" << #__VA_ARGS__ << "]" \
         << ": ";                                          \
    dbgh(__VA_ARGS__)
#else
#define cerr   \
    if (false) \
    cerr
#define dbg(...)
#endif

#define endl "\n"
#define long int64_t
#define sz(x) int(std::size(x))

bool on(int mask, int bit) {
    return (mask >> bit) & 1;
}

struct mint {
    static constexpr int MOD = 1e9 + 7;

    static int norm(long x) {
        x %= MOD;
        if (x < 0) {
            x += MOD;
        }
        return x;
    }

    static mint pow(mint base, long exp) {
        mint ans = 1;

        while (exp) {
            if (exp & 1) {
                ans *= base;
            }
            base *= base;
            exp >>= 1;
        }

        return ans;
    }

    static mint inv(mint x) {
        return mint::pow(x, MOD - 2);
    }

    int x;

    mint() : x(0) {}
    mint(long x) : x(norm(x)) {}

    friend ostream& operator<<(ostream& out, const mint& m) {
        return out << m.x;
    }

    static mint from_unchecked(int x) {
        mint m;
        m.x = x;
        return m;
    }

    mint operator-() const {
        if (!x) {
            return {};
        }
        return mint::from_unchecked(MOD - x);
    }

    mint& operator+=(const mint& m) {
        x += m.x;
        if (x >= MOD) {
            x -= MOD;
        }
        return *this;
    }
    mint& operator-=(const mint& m) {
        return *this += -m;
    }

    mint& operator*=(const mint& m) {
        x = int(long(x) * m.x % MOD);
        return *this;
    }
    mint& operator/=(const mint& m) {
        return *this *= mint::inv(m);
    }

    friend mint operator+(mint a, const mint& b) {
        return a += b;
    }
    friend mint operator-(mint a, const mint& b) {
        return a -= b;
    }
    friend mint operator*(mint a, const mint& b) {
        return a *= b;
    }
    friend mint operator/(mint a, const mint& b) {
        return a /= b;
    }
};

struct M {
    static constexpr int MAXN = 100;

    mint fact[MAXN], ifact[MAXN];

    M() {
        fact[0] = ifact[0] = 1;
        for (int i = 1; i < MAXN; i++) {
            fact[i] = fact[i - 1] * i;
        }
        ifact[MAXN - 1] = mint::inv(fact[MAXN - 1]);
        for (int i = MAXN - 2; i >= 1; i--) {
            ifact[i] = (i + 1) * ifact[i + 1];
        }
    }

    mint choose(int n, int k) const {
        return fact[n] * ifact[k] * ifact[n - k];
    }
} M;

namespace s1 {
bool solve(int, int, const vector<pair<int, int>>& edges) {
    if (!sz(edges)) {
        cout << 1 << endl;
        return true;
    }
    return false;
}
}  // namespace s1

namespace s2 {
bool solve(int n, int kv, const vector<pair<int, int>>& edges) {
    if (kv) {
        return false;
    }

    vector<int> graph[n];
    for (auto& [u, v] : edges) {
        graph[u].push_back(v);
    }

    mint dp[1 << n] {};
    dp[(1 << n) - 1] = 1;
    for (int mask = (1 << n) - 2; mask >= 0; mask--) {
        for (int i = 0; i < n; i++) {
            if (on(mask, i)) {
                continue;
            }

            bool bad = false;
            for (auto& v : graph[i]) {
                bad |= on(mask, v);
            }

            if (!bad) {
                dp[mask] += dp[mask | (1 << i)];
            }
        }
    }

    cout << dp[0] / M.fact[n] << endl;

    return true;
}
}  // namespace s2

void solve() {
    int n, m, kv;
    cin >> n >> m >> kv;

    vector<pair<int, int>> edges(m);
    for (auto& [u, v] : edges) {
        cin >> u >> v;
        u--;
        v--;
    }

    bool solved = s1::solve(n, kv, edges) || s2::solve(n, kv, edges);
    assert(solved);
}

int main() {
    cin.tie(nullptr);
    cin.exceptions(ios::failbit);
    ios_base::sync_with_stdio(false);
    solve();
}