#include using namespace std; #define F first #define S second #define pi M_PI #define R cin>> #define Z class #define ll long long #define ln cout<<'\n' #define in(a) insert(a) #define pb(a) push_back(a) #define pd(a) printf("%.10f\n",a) #define mem(a) memset(a,0,sizeof(a)) #define all(c) (c).begin(),(c).end() #define iter(c) __typeof((c).begin()) #define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--) #define REP(i,m,n) for(int i=(int)(m);i<(int)(n);i++) #define rep(i,n) REP(i,0,n) #define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++) templatevoid pr(A a){cout<void pr(A a,B b){cout<void pr(A a,B b,C c){cout<void pr(A a,B b,C c,D d){cout<void PR(A a,ll n){rep(i,n){if(i)cout<<' ';cout<=0&&x=0&&y P; void Main() { ll n,m; cin >> n >> m; int d[n][n]; rep(i,n) { rep(j,n) d[i][j]=MAX; d[i][i]=0; } rep(i,m) { int x,y; cin >> x >> y; d[x][y]=1; d[y][x]=1; } rep(k,n)rep(i,n)rep(j,n) d[i][j]=min(d[i][j],d[i][k]+d[k][j]); int ans=0; set > s; rep(i,n)rep(j,n)rep(k,n)rep(l,n) { set se; se.in(i),se.in(j),se.in(k),se.in(l); if(se.size()!=4) continue; if(d[i][j]==1&&d[i][k]==2&&d[i][l]==1&&d[j][k]==1&&d[j][l]==2&&d[k][l]==1) { vector v(4);v[0]=i,v[1]=j,v[2]=k,v[3]=l; sort(all(v)); s.in(v); } } pr(s.size()); } int main(){ios::sync_with_stdio(0);cin.tie(0);Main();return 0;}