for (int i = 1; i <= n; i++)
    {
        p[0] = i;
        int j0 = 0;

        fill(minv, minv + m + 1, INF);
        fill(used, used + m + 1, false);

        do
        {
            used[j0] = true;
            int i0 = p[j0];
            int delta = INF;
            int j1 = 0;

            for (int j = 1; j <= m; j++)
            {
                if (!used[j])
                {
                    int cur = a[i0][j] - u[i0] - v[j];

                    if (cur < minv[j])
                    {
                        minv[j] = cur;
                        way[j] = j0;
                    }

                    if (minv[j] < delta)
                    {
                        delta = minv[j];
                        j1 = j;
                    }
                }
            }

            for (int j = 0; j <= m; j++)
            {
                if (used[j])
                {
                    u[p[j]] += delta;
                    v[j] -= delta;
                }
                else
                {
                    minv[j] -= delta;
                }
            }

            j0 = j1;

        } while (p[j0] != 0);

        do
        {
            int j1 = way[j0];
            p[j0] = p[j1];
            j0 = j1;
        } while (j0 != 0);
    }