#include <iostream>
#include <bits\stdc++.h>
using namespace std;
 
int main() {
	bool ara[11][11];
 
	for(int i = 1 ; i <=10 ; i++){
		for(int j = 1; j <= 10 ; j++){
			ara[i][j] = 0;
		}
	}
 
	int nodes,edges;
 
	scanf("%d",&nodes);
	scanf("%d",&edges);
 
	for(int i = 1 ; i <= edges ; i++)
	{
		scanf("%d %d",&a,&b);
		ara[a][b]=ara[b][a] = true ;
	}
 
	if(ara[3][4]== true)
		printf("Edge exists between 3 and 4\n");
 
	if(ara[4][5]==false)
		printf("Edge does not exist\n");
 
	return 0;
}

I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8Yml0c1xzdGRjKysuaD4KdXNpbmcgbmFtZXNwYWNlIHN0ZDsKCmludCBtYWluKCkgewoJYm9vbCBhcmFbMTFdWzExXTsKCQoJZm9yKGludCBpID0gMSA7IGkgPD0xMCA7IGkrKyl7CgkJZm9yKGludCBqID0gMTsgaiA8PSAxMCA7IGorKyl7CgkJCWFyYVtpXVtqXSA9IDA7CgkJfQoJfQoJCglpbnQgbm9kZXMsZWRnZXM7CgkKCXNjYW5mKCIlZCIsJm5vZGVzKTsKCXNjYW5mKCIlZCIsJmVkZ2VzKTsKCQoJZm9yKGludCBpID0gMSA7IGkgPD0gZWRnZXMgOyBpKyspCgl7CgkJc2NhbmYoIiVkICVkIiwmYSwmYik7CgkJYXJhW2FdW2JdPWFyYVtiXVthXSA9IHRydWUgOwoJfQoJCglpZihhcmFbM11bNF09PSB0cnVlKQoJCXByaW50ZigiRWRnZSBleGlzdHMgYmV0d2VlbiAzIGFuZCA0XG4iKTsKCQkKCWlmKGFyYVs0XVs1XT09ZmFsc2UpCgkJcHJpbnRmKCJFZGdlIGRvZXMgbm90IGV4aXN0XG4iKTsKCQoJcmV0dXJuIDA7Cn0=