check

#include <bits/stdc++.h>
using namespace std;

int main() {
    int n; cin >> n;
    
    // One valid solution
    cout << 1 << " " << n << "\n";
    
    return 0;
}

#include <bits/stdc++.h>
using namespace std;

int main() {
    // Read graph from input file
    ifstream in(".qt/input.txt");
    int n, m;
    in >> n >> m;
    
    vector<vector<int>> adj(n);
    for (int i = 0; i < m; i++) {
        int u, v;
        in >> u >> v;
        adj[u].push_back(v);
        adj[v].push_back(u);
    }
    
    // Read solution's path
    vector<int> path(n);
    for (int i = 0; i < n; i++) {
        cin >> path[i];
    }
    
    // Validate:
    // 1. All nodes visited exactly once
    set<int> visited(path.begin(), path.end());
    if (visited.size() != n) {
        cout << "NO" << endl;
        return 0;
    }
    
    // 2. Each consecutive pair has an edge
    for (int i = 0; i < n - 1; i++) {
        int u = path[i], v = path[i + 1];
        if (find(adj[u].begin(), adj[u].end(), v) == adj[u].end()) {
            cout << "NO" << endl;
            return 0;
        }
    }
    
    cout << "YES" << endl;
    return 0;
}