#define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
#include <random>

using namespace std;

//呪文
#define DUMPOUT cerr
#define dump(...) DUMPOUT<<"  ";DUMPOUT<<#__VA_ARGS__<<" :["<<__LINE__<<":"<<__FUNCTION__<<"]"<<endl;DUMPOUT<<"    ";dump_func(__VA_ARGS__)

typedef unsigned uint; typedef long long ll; typedef unsigned long long ull; typedef pair<int, int> pii; typedef pair<ll, ll> pll; typedef pair<double, double> pdd; typedef pair<string, string> pss;
template <typename _KTy, typename _Ty> ostream& operator << (ostream& ostr, const pair<_KTy, _Ty>& m) { ostr << "{" << m.first << ", " << m.second << "}"; return ostr; }
template <typename _KTy, typename _Ty> ostream& operator << (ostream& ostr, const map<_KTy, _Ty>& m) { if (m.empty()) { ostr << "{ }"; return ostr; } ostr << "{" << *m.begin(); for (auto itr = ++m.begin(); itr != m.end(); itr++) { ostr << ", " << *itr; } ostr << "}"; return ostr; }
template <typename _Ty> ostream& operator << (ostream& ostr, const vector<_Ty>& v) { if (v.empty()) { ostr << "{ }"; return ostr; } ostr << "{" << v.front(); for (auto itr = ++v.begin(); itr != v.end(); itr++) { ostr << ", " << *itr; }	ostr << "}"; return ostr; }
template <typename _Ty> ostream& operator << (ostream& ostr, const set<_Ty>& s) { if (s.empty()) { ostr << "{ }"; return ostr; } ostr << "{" << *(s.begin()); for (auto itr = ++s.begin(); itr != s.end(); itr++) { ostr << ", " << *itr; }	ostr << "}"; return ostr; }
template <typename _Ty> ostream& operator << (ostream& ostr, const stack<_Ty>& s) { if (s.empty()) { ostr << "{ }"; return ostr; } stack<_Ty> t(s); ostr << "{" << t.top(); t.pop(); while (!t.empty()) { ostr << ", " << t.top(); t.pop(); } ostr << "}";	return ostr; }
template <typename _Ty> ostream& operator << (ostream& ostr, const list<_Ty>& l) { if (l.empty()) { ostr << "{ }"; return ostr; } ostr << "{" << l.front(); for (auto itr = ++l.begin(); itr != l.end(); ++itr) { ostr << ", " << *itr; } ostr << "}"; return ostr; }
template <typename _KTy, typename _Ty> istream& operator >> (istream& istr, pair<_KTy, _Ty>& m) { istr >> m.first >> m.second; return istr; }
template <typename _Ty> istream& operator >> (istream& istr, vector<_Ty>& v) { for (size_t i = 0; i < v.size(); i++) istr >> v[i]; return istr; }
namespace aux { // print tuple
	template<typename Ty, unsigned N, unsigned L> struct tp { static void print(ostream& os, const Ty& v) { os << get<N>(v) << ", "; tp<Ty, N + 1, L>::print(os, v); } };
	template<typename Ty, unsigned N> struct tp<Ty, N, N> { static void print(ostream& os, const Ty& value) { os << get<N>(value); } };
}
template<typename... Tys> ostream& operator<<(ostream& os, const tuple<Tys...>& t) { os << "{"; aux::tp<tuple<Tys...>, 0, sizeof...(Tys)-1>::print(os, t); os << "}"; return os; }

template<typename A, size_t N, typename T> inline void Fill(A(&array)[N], const T &val) { std::fill((T*)array, (T*)(array + N), val); }

void dump_func() { DUMPOUT << endl; }
template <class Head, class... Tail> void dump_func(Head&& head, Tail&&... tail) { DUMPOUT << head; if (sizeof...(Tail) == 0) { DUMPOUT << " "; } else { DUMPOUT << ", "; } dump_func(std::move(tail)...); }

#define PI 3.14159265358979323846
#define EPS 1e-11
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)
#define all(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define fake false



ll encode(const vector<vector<int>>& cups) {
	ll res = 0;
	for (int i = 0; i < 3; i++) {
		int offset = 16 * i;

		for (int j = 0; j < cups[i].size(); j++) {
			int k = cups[i][j];
			res |= (1LL << (offset + k));
		}
	}
	return res;
}

set<ll> states;

void _add_next_state(queue<vector<vector<int>>>& qu, vector<vector<int>>& cups, int i, int j) {
	// i to j
	if (!cups[i].empty()) {
		if (cups[j].empty() || cups[j].back() < cups[i].back()) {
			cups[j].push_back(cups[i].back());
			cups[i].pop_back();
			ll s = encode(cups);
			if (states.find(s) == states.end()) {
				qu.push(cups);
				states.insert(s);
			}
			cups[i].push_back(cups[j].back());
			cups[j].pop_back();
		}
	}
}

void add_next_state(queue<vector<vector<int>>>& qu, vector<vector<int>>& cups) {
	//a to b
	_add_next_state(qu, cups, 0, 1);
	//b to a
	_add_next_state(qu, cups, 1, 0);
	//c to b
	_add_next_state(qu, cups, 2, 1);
	//b to c
	_add_next_state(qu, cups, 1, 2);
}

int main()
{
	//clock_t start, end;
	//start = clock();

	cin.tie(0);
	ios::sync_with_stdio(false);

	while (true) {
		int N, M;
		cin >> N >> M;
		if (N == 0 && M == 0) break;

		states.clear();
		queue<vector<vector<int>>> qu;

		vector<vector<int>> cups(3);
		for (int i = 0; i < 3; i++) {
			int nCups;
			cin >> nCups;
			for (int j = 0; j < nCups; j++) {
				int k;
				cin >> k;
				cups[i].push_back(k);
			}
		}

		states.insert(encode(cups));
		qu.push(cups);

		bool flag = false;
		for (int step = 0; step < M; step++) {
			//dump(step);
			queue<vector<vector<int>>> qu_tmp;
			while (!qu.empty()) {
				vector<vector<int>> c = qu.front(); qu.pop();
				//dump(c);
				if (c[0].size() == N || c[2].size() == N) {
					//dump("find");
					cout << step << endl;
					flag = true;
					break;
				}
				add_next_state(qu_tmp, c);
				//dump(c);
				//dump(states);
			}
			if (flag) break;
			qu = qu_tmp;
			//while (!qu_tmp.empty()) {
			//	auto e = qu_tmp.front(); qu_tmp.pop();
			//	dump(e);
			//}
		}
		if (!flag) cout << -1 << endl;
	}

	//end = clock();
	//printf("%d msec.\n", end - start);

	return 0;
}



Measured memory_bytes: 130212