#include <cstdio>
#include <algorithm>
#include <vector>

const int DIM = 5e3 + 5;
const int INF = 0x3f3f3f3f;
const int SRC = 0;
const int DST = DIM - 1;

std::vector< std::vector<int> > Capacity, Cost, Flow, Edge, Father;

void ResetArrays( int N ) {
    Capacity.clear(); Capacity.resize( N * 100 + 1 );
    Father.clear(); Father.resize( N * 100 + 1 );
    Cost.clear(); Cost.resize( N * 100 + 1 );
    Edge.clear(); Edge.resize( N * 100 + 1 );
    Flow.clear(); Flow.resize( N * 100 + 1 );

    for( int i = 0; i < N * 100 + 1; i ++ ) {
        Capacity[i].resize( N * 100 + 1 );
        Cost[i].resize( N * 100 + 1 );
        Flow[i].resize( N * 100 + 1 );
    }

    return;
}

void SolveTestCase( void ) {
    int N, M, X, Y, Z;

    scanf( "%d %d", &N, &M );
    ResetArrays( N );

    return;
}

int main( int argc, const char *argv[] ) {
    int T = 1;

    freopen( "algola.in" , "r", stdin  );
    freopen( "algola.out", "w", stdout );

    for( int i = 1; i <= T; i ++ )
        SolveTestCase();

    return 0;
}