#include <bits/stdc++.h>

#define all(x) x.begin(), x.end()
#define len(x) (int)(x.size())
#define mp make_pair
#define pb push_back
#define fi first
#define se second

using namespace std;

typedef pair<int, int> pii;
typedef long long ll;
typedef long double ld;

bool umin(int& a, int b) {
    if(b < a) {
        a = b;
        return true;
    }
    return false;
}

bool umax(int& a, int b) {
    if(b > a) {
        a = b;
        return true;
    }
    return false;
}

//#ifdef KoRoVa
//#define DEBUG for (bool __DEBUG=1;__DEBUG;__DEBUG=0)
//#define LOG(...) prnt(#__VA_ARGS__" ::",_VA_ARGS)<<endl
//#else
//#define DEBUG while(false)
//#define LOG(...) if(false)
//#endif

template <class ...Ts> auto &prnt(Ts ...ts) {
    return ((cerr << ts << " "), ...);
}

const int max_n = -1, inf = 1000111222;

const ll linf = 1000111222000111222;

void test_case() {
    int n, m;
    cin>>n>>m;
    vector<vector<int>> ans;
    for(int i = 0; i < m; i++)
    {
        int a, b;
        cin>>a>>b;
        vector<int> res(n);
        res[0] = a;
        res[1] = b;
        int j = 2;
        for(int q = 1; q <= n; q++)
        {
            if(q == a || q == b)
                continue;
            res[j++] = q;
        }
        ans.push_back(res);
        j = 0;
        for(int q = n; q >= 1; q--)
        {
            if(q == a || q == b)
                continue;
            res[j++] = q;
        }
        res[j++] = a;
        res[j++] = b;
        ans.push_back(res);
    }
    cout << "YES\n";
    cout<<ans.size()<<'\n';
    for(auto b : ans)
    {
        for(auto k : b)
            cout<<k<<' ';
        cout<<'\n';
    }

}

signed main() {

//    freopen("input.txt", "r", stdin);

    ios_base::sync_with_stdio(false);

    cin.tie(nullptr);

    int testcases = 1;

//    cin >> testcases;

    while(testcases--) test_case();

    exit(0);
}