{

E[ec].next = V[u].first;

V[u].first = ec;

E[ec].endp = v;

E[ec].f = f;

ec++;

{

queue<int> Q;

static bool inq[VERTEX_COUNT];

memset(inq, false, sizeof(inq));

Q.push(sink), inq[sink] = true;

while (!Q.empty())

{

int u = Q.front();

Q.pop();

for (int cur = V[u].first; cur != 0; cur = E[cur].next)

{

if (E[cur ^ 1].f > 0 && inq[E[cur].endp] == false)

{

V[E[cur].endp].dis = V[u].dis + 1;

Q.push(E[cur].endp), inq[E[cur].endp] = true;

}

}

}

return inq[src] == true;

{

if (u == sink) return curf;

int totalf = 0;

for (int cur = V[u].first; cur != 0 && totalf < curf; cur = E[cur].next)

{

if (V[u].dis == V[E[cur].endp].dis + 1 && E[cur].f > 0)

{

int f = dfs(E[cur].endp, min(E[cur].f, curf - totalf));

E[cur].f -= f;

E[cur ^ 1].f += f;

totalf += f;

}

}

return totalf;

{

int res = 0;

while (bfs() == true)

{

int flow;

do

{

flow = dfs(src, INF);

res += flow;

} while (flow > 0);

}

return res;

{

int u, v, f;

scanf("%d%d", &iec, &ivc);

for (int i = 0; i < iec; i++)

{

scanf("%d%d%d", &u, &v, &f);

add_edge(u, v, f);

add_edge(v, u, 0);

}

src = 1, sink = ivc;

printf("%d", max_flow());

return 0;