#include <iostream>
#include <string>
#include <algorithm>
#include <vector>

using namespace std;

int main() {
	int n;
	cin >> n;
	int k;
	vector<int> T;
	int b;
	cin >> k;
	for (int i = 0; i < k; i++) {
		cin >> b;
		T.push_back(b);
	}

	for (int i = 0; i < (1 << n); i++) {
		vector<int> v;
		for (int j = 0; j < n; j++) {
			if (i & (1 << j))	v.push_back(j);
		}

		int check = 1;
		for (auto it = T.begin(); it != T.end(); it++) {
			auto itr = find(v.begin(), v.end(), *it);
			if (itr == v.end()) {
				check = 0;
				break;
			}
		}

		if (check) {
			cout << i << ":";
			for (int l = 0; l < v.size(); l++) {
				cout << " " << v[l];
			}
			cout << endl;
		}
	}
}

