#include<iostream>
#include<cmath>
using namespace std;

int main()
{
    int n, k;
    double n2;

    cin >> n;
    cin >> k;

    n2 = n;
    int bit[n], b[k];
    int selection[n];

    for( int i = 0; i < k; i++ )
        cin >> b[i];

   
    for( int i = 0; i < n; i++ )
    {
        bit[i] = i;
        selection[i] = 0;
    }
    
    for( int i = 0; i < pow( 2, n2 ); i++ )
    {
        int x = i;
        int j = 0;
        while( x > 1 )
        {
            selection[j] = x % 2;
            j++;
            x = x / 2;
        }
        selection[j] = x;

        bool judge = true;
        for( int t = 0; t < k; t++ )
            if( selection[b[t]] == 0 )
                judge = false;     

        if( judge == true )
        {
            cout << i << ":";
            for( int t = 0; t < n; t++ )
                if( selection[t] == 1 )
                    cout << " " << bit[t];
            cout<< endl;
        }
    }
    return 0;
}

