#include #include #include using namespace std; int d (const void* a,const void* b){int* p1=(int*)a;int* p2=(int*)b; return p1[0] - p2[0];}int main(){int a,b,c,e,f,i,j,k,n;stack q; stack r;cin>>n>>k>>a>>b;k=2*k;int p[k][2]; int* g;int** h=new int*[n+1];int* l=new int[n+1];int* m=new int[n+1];int* o=new int[n+1];for(i=0;i>p[i][0]>>p[i][1]; p[i+1][1]=p[i][0];p[i+1][0]=p[i][1];}qsort(p,k,2*sizeof(int),d);i=j=0; while(i=b) {cout<((n*(n-1))/2+1)){int kk=0;int pp[n*(n-1)-k][2];int* t=pp[0];for(i=1;i<=n;i++){ if(h[i]==NULL){h[i]=t;for(j=1;j<=n;j++){if(j!=i) {kk++;t[0]=i;t[1]=j;t+=2;}}l[i]=n-1;} else{for(j=1;j<=n;j++){m[j]=0;}g=h[i];for(j=0;j=a){cout<=a){cout<