#include <iostream>
#include <fstream>
#include <vector>
#include <queue>

using namespace std;

ifstream f ("fmcm.in");
ofstream g ("fmcm.out");

vector <int> l[355];
int n, dst, c[355][355], fl[355][355], cost[355][355], cost1[355][355], t[355], d[355], v[355];

void bellman_ford(int vf)
{
    int i;
    for (i = 1; i <= n; i++)
    {
        d[i] = 999999;
        v[i] = 0;
    }
    queue <int> q;
    q.push(vf);
    d[vf] = 0;
    v[vf] = 1;
    while (!q.empty())
    {
        vf = q.front();
        q.pop();
        v[vf] = 0;
        for (i = 0; i < l[vf].size(); i++)
        {
            if (d[vf] + cost[vf][l[vf][i]] < d[l[vf][i]] && c[vf][l[vf][i]] > 0 && !v[l[vf][i]])
            {
                d[l[vf][i]] = d[vf] + cost[vf][l[vf][i]];
                v[l[vf][i]] = 1;
                q.push(l[vf][i]);
            }
        }
    }
}

int dijkstra(int vf)
{
    auto cmp = [](int x, int y){
        return d[x] < d[y];
    };
    priority_queue <int, vector<int>, decltype(cmp)> q(cmp);
    int i;
    for (i = 1; i <= n; i++)
    {
        d[i] = 999999;
        t[i] = 0;
    }
    q.push(vf);
    d[vf] = 0;
    t[vf] = 0;
    while (!q.empty())
    {
        vf = q.top();
        q.pop();
        for (i = 0; i < l[vf].size(); i++)
            if (fl[vf][l[vf][i]] < c[vf][l[vf][i]] && d[vf] + cost1[vf][l[vf][i]] < d[l[vf][i]])
                {
                    q.push(l[vf][i]);
                    d[l[vf][i]] = d[vf] + cost1[vf][l[vf][i]];
                    t[l[vf][i]] = vf;
                }
    }
    if (d[dst] < 999999) return 1;
    return 0;
}

int main()
{int m, s, flux = 0, i, j, x, y, capac, cst, mn;
f >> n >> m >> s >> dst;
for (i = 0; i < m; i++)
{
    f >> x >> y >> capac >> cst;
    l[x].push_back(y);
    l[y].push_back(x);
    c[x][y] = capac;
    cost[x][y] = cst;
    cost[y][x] = -cst;
}
bellman_ford(s);
for (i = 1; i <= n; i++)
    for (j = 0; j < l[i].size(); j++)
        if (c[i][l[i][j]])
            cost1[i][l[i][j]] += d[i] - d[l[i][j]];
while (dijkstra(s))
{
    i = dst;
    mn = 999999;
    while (i != s)
    {
        if (c[t[i]][i] - fl[t[i]][i] < mn)
            mn = c[t[i]][i] - fl[t[i]][i];
        if (cost1[t[i]][i] != cost[t[i]][i] && cost[t[i]][i] < 0)
            d[dst] -= cost1[t[i]][i] - cost[t[i]][i];
        i = t[i];
    }
    cout << flux << ' ';
    flux += mn * d[dst];
    i = dst;
    while (i != s)
    {
        fl[t[i]][i] += mn;
        fl[i][t[i]] -= mn;
        i = t[i];

    }
}
g << flux;
return 0;
}