Sgu/196

#include<cstdio>
 
const int MAX=10000+10;
int n,m;
int num[MAX],answer;
 
int main()
{
	#ifndef ONLINE_JUDGE
	freopen("196.in","r",stdin);freopen("196.out","w",stdout);
	#endif
	int i,x,y;
	scanf("%d %d",&n,&m);
	for(i=1;i<=m;++i)
	{
		scanf("%d %d",&x,&y);
		++num[x];++num[y];
	}
	for(i=1;i<=n;++i)
		answer+=num[i]*num[i];
	printf("%d\n",answer);
}

//证明见dd神牛
//http://ddsgu.yo2.cn/articles/196.html
import java.util.Scanner;
 
public class Solution {
 
	static int a[] = new int[11111];
	static int tmp = 0;
	static long ans = 0;
 
	public static void main(String args[]) {
		Scanner cin = new Scanner(System.in);
		int n = cin.nextInt();
		int m = cin.nextInt();
		for (int i = 1; i <= m * 2; i++) {
			tmp = cin.nextInt();
			a[tmp]++;
		}
		for (int i = 1; i <= n; i++)
			ans += (long)a[i] * a[i];
		System.out.println(ans);
	}
}
//by phonism