////////////////////////////////////////
///  tu3 pro-con template            ///
////////////////////////////////////////
#include <cassert>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <iostream>
#include <sstream>
#include <algorithm>
#include <numeric>
#include <functional>
#include <vector>
#include <queue>
#include <string>
#include <complex>
#include <stack>
#include <set>
#include <map>
#include <list>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <regex>
using namespace std;

//// MACRO ////
#define countof(a) (sizeof(a)/sizeof(a[0]))

#define REP(i,n) for (int i = 0; i < (n); i++)
#define RREP(i,n) for (int i = (n)-1; i >= 0; i--)
#define FOR(i,s,n) for (int i = (s); i < (n); i++)
#define RFOR(i,s,n) for (int i = (n)-1; i >= (s); i--)
#define pos(c,i) c.being() + (i)
#define allof(c) c.begin(), c.end()
#define aallof(a) a, countof(a)
#define partof(c,i,n) c.begin() + (i), c.begin() + (i) + (n)
#define apartof(a,i,n) a + (i), a + (i) + (n)
#define long long long

#define EPS 1e-9
#define INF (1L << 30)
#define LINF (1LL << 60)

#define PREDICATE(t,a,exp) [&](const t & a) -> bool { return exp; }
#define COMPARISON_T(t) bool(*)(const t &, const t &)
#define COMPARISON(t,a,b,exp) [&](const t & a, const t & b) -> bool { return exp; }
#define CONVERTER(TSrc,t,TDest,exp) [&](const TSrc &t)->TDest { return exp; }

inline int sign(double x) { return (abs(x) < EPS ? 0 : x > 0 ? 1 : -1); }
inline bool inRange(int val, int min, int max) { return val >= min && val < max; }
inline bool inRange(double val, double min, double max) { return val - min > -EPS && val - max < EPS; }
inline bool inRange(int x, int y, int W, int H) { return x >= 0 && x < W && y >= 0 && y < H; } // W,H含まない
template <class T> struct vevector : public vector<vector<T>> { vevector(int n = 0, int m = 0, const T &initial = T()) : vector<vector<T>>(n, vector<T>(m, initial)) { } };
template <class T> struct vevevector : public vector<vevector<T>> { vevevector(int n = 0, int m = 0, int l = 0, const T &initial = T()) : vector<vevector<T>>(n, vevector<T>(m, l, initial)) { } };
template <class T> struct vevevevector : public vector<vevevector<T>> { vevevevector(int n = 0, int m = 0, int l = 0, int k = 0, const T &initial = T()) : vector<vevevector<T>>(n, vevevector<T>(m, l, k, initial)) { } };

//// i/o helper ////

#ifdef _DEBUG
#define DEBUG WRITE
inline void readfrom(string filename) { freopen(filename.c_str(), "r", stdin); }
inline void writeto(string filename) { freopen(filename.c_str(), "w", stdout); }
#else
#define DEBUG(...)
inline void readfrom(...) { }
inline void writeto(...) { }
#endif
#ifdef ccout
#  define cout ccout
#  define endl cendl
#endif

struct _Reader { template <class T> _Reader operator ,(T &rhs) { cin >> rhs; return *this; } };
struct _Writer { bool f; _Writer() : f(false) { } template <class T> _Writer operator ,(const T &rhs) { cout << (f ? " " : "") << rhs; f = true; return *this; } };
#define READ(t,...) t __VA_ARGS__; _Reader(), __VA_ARGS__
#define WRITE(...) _Writer(), __VA_ARGS__; cout << endl

template <class T> T read() { T t; cin >> t; return t; }
template <class T> vector<T> read(int n) { vector<T> v; REP(i, n) { v.push_back(read<T>()); } return v; }
template <class T> vevector<T> read(int n, int m) { vevector<T> v; REP(i, n) v.push_back(read<T>(m)); return v; }
template <class T> vevector<T> readjag() { return read<T>(read<int>()); }
template <class T> vevector<T> readjag(int n) { vevector<T> v; REP(i, n) v.push_back(readjag<T>()); return v; }

template <class T1, class T2> inline istream & operator >> (istream & in, const pair<T1, T2> &p) { in >> p.first >> p.second; return in; }
template <class T1, class T2> inline ostream & operator << (ostream &out, const pair<T1, T2> &p) { out << p.first << " " << p.second; return out; }
template <class T> inline ostream & operator << (ostream &out, const vector<T> &v)
{
	ostringstream ss;
	for (auto x : v) ss << x << ' ';
	auto s = ss.str();
	out << s.substr(0, s.length() - 1);
	return out;
}

//// start up ////
void solve();


int main()
{
	solve();
	return 0;
}

// idconv //
template<class T>
struct idconv
{
	map<T,int> m;
	int get(T t)
	{
		auto it = m.find(t);
		if (it == m.end()) { it = m.insert(make_pair(t, (int)m.size())).first; }
		return it->second;
	}
};

////////////////////
/// template end ///
////////////////////

void solve()
{
	int testcases = 1;
	REP(testcase, testcases)
	{
		READ(int, N, T);
		typedef int STID; // STATION
		typedef int RTID; // ROUTE
		typedef int STINDX;
		typedef pair<RTID, STINDX> POS;

		READ(string, A, B);
		idconv<string> idc;
		STID stA = idc.get(A);
		STID stB = idc.get(B);
		
		map<STID, vector<POS>> transferMap;
		vevector<STID> routeTable;
		vevector<int> timeTable;
		REP(i, N)
		{
			READ(int, a);
			auto sts = read<string>(a);
			vector<STID> v;
			transform(allof(sts), back_inserter(v), CONVERTER(string, s, STID, idc.get(s)));
			routeTable.push_back(v);
			timeTable.push_back(read<int>(a - 1));
			
			REP(j, a)
			{
				transferMap[v[j]].emplace_back(i, j);
			}
		}

		pair<long, long> result = { -1, -1 };
		struct P { POS p; long time, trans; };
		set<POS> visited;
		set<STID> visited2;
		priority_queue<P, vector<P>, COMPARISON_T(P)> q(COMPARISON(P, a, b, a.time != b.time ? a.time > b.time : a.trans > b.trans));
		for (auto start : transferMap[stA]) { q.push({ start, 0, 0 }); }

		while (!q.empty())
		{
			P p = q.top(); q.pop();

			if (visited.count(p.p)) continue;
			visited.insert(p.p);
			RTID r = p.p.first;
			STINDX sidx = p.p.second;
			STID stid = routeTable[r][sidx];
			
			// 着いた
			if (stid == stB) { result = make_pair(p.time, p.trans); break;  }

			// そのまま乗る
			vector<STID> &sts = routeTable[r];
			if (sidx < sts.size() - 1)
			{
				POS next = make_pair(r, sidx + 1);
				if (!visited.count(next)) q.push({ next, p.time + timeTable[r][sidx], p.trans });
			}
			if (sidx > 0)
			{
				POS next = make_pair(r, sidx - 1);
				if (!visited.count(next)) q.push({ next, p.time + timeTable[r][sidx - 1], p.trans });
			}

			// 乗り換える
			if (visited2.count(stid)) continue;
			visited2.insert(stid);
			for (auto next : transferMap[stid])
			{
				if (!visited.count(next)) { q.push({ next, p.time + T, p.trans + 1 }); }
			}
		}
		if (result.first >= 0) { WRITE(result); }
		else { WRITE(-1); }
	}
}

Measured memory_bytes: 23052