#include <bits/stdc++.h>

using namespace std;

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--)
#define SZ(a) int(a.size())
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first
#define S second

typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef double db;

const int N = 10'474;
const int INF = 1e9 + 47;
vector<pair<int, PII>> g[N];
bool used[N];
int cost[N];
int pres[N];
int deg[N];
map<string, int> m;

int add(string s)
{
	if (!m.count(s))
		m[s] = SZ(m);
	return m[s];
}

VI tps;

void dfs(int v)
{
	used[v] = true;
	for (auto [to, _] : g[v])
		if (!used[to])
			dfs(to);
	tps.PB(v);
}

int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	int b;
	int n;
	cin >> b >> n;
	FOR (i, 0, n)
	{
		string s, t;
		cin >> s >> t;
		int u = add(s);
		int v = add(t);
		cin >> s;
		int c, p;
		cin >> c >> p;
		g[v].PB({u, {c, p}});
		deg[u]++;
	}
	FOR (i, 0, SZ(m))
	{
		if (!used[i])
			dfs(i);
	}
	reverse(ALL(tps));
	FOR (i, 0, SZ(m))
	{
		cost[i] = INF;
		pres[i] = -INF;
	}
	for (auto v : tps)
	{
		if (deg[v] == 0)
		{
			cost[v] = 0;
			pres[v] = 0;
		}
		for (auto [to, par] : g[v])
		{
			auto [c, p] = par;
			if (cost[to] > cost[v] + c || (cost[to] == cost[v] + c && pres[to] < pres[v] + p))
			{
				cost[to] = cost[v] + c;
				pres[to] = pres[v] + p;
			}
		}
	}
	VI dp(N, 0);
	FOR (i, 0, SZ(m))
	{
		RFOR (j, N - cost[i], 0)
		{
			dp[j + cost[i]] = max(dp[j + cost[i]], dp[j] + pres[i]);
		}
	}
	int idx = max_element(dp.begin(), dp.begin() + b + 1) - dp.begin();
	cout << dp[idx] << '\n';
	cout << idx << '\n';
	
	
	
	return 0;
}