using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;
using System.Runtime.Intrinsics.Arm;

class Program
{
    static int NN => int.Parse(ReadLine());
    static int[] NList => ReadLine().Split().Select(int.Parse).ToArray();
    static int[][] NArr(long n) => Enumerable.Repeat(0, (int)n).Select(_ => NList).ToArray();
    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var c = NList;
        var (n, m, k) = (c[0], c[1], c[2]);
        var map = NArr(m);
        var plist = new int[n];
        for (var i = 0; i < n; ++i) plist[i] = i;
        var ilist = new int[n];
        var olist = new int[n];
        foreach (var edge in map)
        {
            ++olist[edge[0] - 1];
            ++ilist[edge[1] - 1];
        }
        Array.Sort(plist, (l, r) =>
        {
            var d = olist[r].CompareTo(olist[l]);
            if (d != 0) return d;
            return ilist[r].CompareTo(ilist[l]);
        });
        var ans = 0L;
        for (var i = 0; i < n; ++i)
        {
            if (olist[plist[i]] > 0 || i <= k) ans += Math.Max(0, k - ilist[plist[i]]);
        }
        WriteLine(ans);
    }
}