graph

#include <iostream>
using namespace std;

class Graph
{
  private:  int n, m;
  int arr[100][100];
  public:
    Graph()
   {
        n=10;
        m=0;
        for (int i=0; i<n; i++)
        {
         for (int j=0; j<n; j++)
         arr[i][j]=0;
        }
   }
   Graph (int a, int b)
   {
        int l, r;
        n=a;
        m=b;
      for (int i=0; i<n; i++)
      for (int j=0; j<n; j++)
      arr[i][j]=0;

        for (int i=0; i<m; i++)
        {
          cin >> l >> r;
          arr[l-1][r-1]=1;
        }

   }
  void sum ()
{
  int k, arrive[n], ar[n][n];
  for (int i=0; i<n; i++)
  {
    for (int j=0; j<n; j++)
    k+=arr[i][j];
    arrive[i]=k;
    k=0;
  }
  k = n-1;
 for (int i=0; i<n; i++)
 {
   k=n-1;
 for (int j=0; j<n; j++)
        {
            ar[i][k] = arr[j][i];
            k--;
        }
 }
 k=0;
for (int i=0; i<n; i++)
  {
    for (int j=0; j<n; j++)
    k+=ar[i][j];
    arrive[i]+=k;
    k=0;
  }
  for (int i=0; i<n; i++)
  cout << arrive [i] << " ";
}
};

int main ()
{
  Graph object;
  int n, m;
  cin >> n >> m;
  object=Graph(n, m);
  object.sum();
  return 0;
}