2011 D

#include<fstream>
#include<queue>
#include<vector>
#include <algorithm>
using namespace std;

// 9 10
// 1 2
// 3 4
// 3 5
// 4 6
// 4 9
// 9 8
// 1 7
// 7 3
// 1 3

ifstream cin ("input.txt");
ofstream cout ("output.out");

int main(){
    int n,m;
    int a,b;
    //int k = 3;
    int maxA = 0;
    int maxB = 0;
    int counter =0;
    int k = 1;
    int broiTransportniVuzli = 0;
    vector <int> newVec;
    vector <int> outputVector;
    cin>>n>>m; // n - nodes, m - arcs
    vector <int> samp;
    vector < vector <int> > conn(n+1,samp);
    // load adajency matrix
    for(int i=0;i<m;i++){
        cin>>a>>b;
        if(a > maxA) maxA = a;
      //  if(b > maxB) maxB = b;
        conn[a].push_back(b);
        conn[b].push_back(a);
    }
    bool visited[n+1];
    for(int i=0;i<n+1;i++){
        visited[i] = false;
    }
    for(int i =1; i<=maxA; i++)
    {
       cout << conn[i].size() << endl;
        int sizeConn = conn[i].size();
        if(sizeConn >=k)
        {
            counter++;
            newVec.push_back(i);
        }
    }
    cout << "Counter: " << counter << endl;
    cout << "VEC" << endl;
    sort(newVec.begin(), newVec.end());
    for(int i =0; i<newVec.size(); i++)
    {
        cout << newVec[i] << endl;
    }
}


//Raboti