#include <bits/stdc++.h>
const int LG = 21;
const int FN = 400005;
const long long MOD = 1e9 + 7;
const long long INF = 1e9;
const long long INFLL = 1e18;
using namespace std;
int cx[4] = {-1, 0, 1, 0};
int cy[4] = {0, -1, 0, 1};
long long inq(long long x, long long y) {
  if (!y) return 1 % MOD;
  long long l = inq(x, y / 2);
  if (y % 2) return l * l % MOD * x % MOD;
  return l * l % MOD;
}
long long rev(long long x) { return inq(x, MOD - 2); }
bool __precomputed_combinatorics = 0;
vector<long long> __fact, __ufact, __rev;
void __precompute_combinatorics() {
  __precomputed_combinatorics = 1;
  __fact.resize(FN);
  __ufact.resize(FN);
  __rev.resize(FN);
  __rev[1] = 1;
  for (int i = 2; i < FN; i++)
    __rev[i] = MOD - __rev[MOD % i] * (MOD / i) % MOD;
  __fact[0] = 1, __ufact[0] = 1;
  for (int i = 1; i < FN; i++)
    __fact[i] = __fact[i - 1] * i % MOD,
    __ufact[i] = __ufact[i - 1] * __rev[i] % MOD;
}
long long fact(int x) {
  if (!__precomputed_combinatorics) __precompute_combinatorics();
  return __fact[x];
}
long long cnk(int n, int k) {
  if (!__precomputed_combinatorics) __precompute_combinatorics();
  return __fact[n] * __ufact[n - k] % MOD * __ufact[k] % MOD;
}
const int N = 1010;
const int M = 101010;
vector<int> graph[N];
int go[N][N], f[N][N], g[N][N];
int fr[M], to[M], glina[M];
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int n, m;
  cin >> n >> m;
  for (int(i) = 0; (i) != (m); (i)++) {
    int a, b;
    cin >> a >> b;
    glina[i] = graph[a].size();
    graph[a].push_back(b);
    fr[i] = a, to[i] = b;
  }
  for (int i = 1; i <= n; i++) {
    vector<int> q = {i};
    go[i][i] = 1;
    for (int j = 0; j < q.size(); j++) {
      int v = q[j];
      for (auto u : graph[v])
        if (!go[i][u]) go[i][u] = 1, q.push_back(u);
    }
  }
  for (int i = 1; i <= n; i++)
    for (int j = 1; j <= n; j++) f[i][j] = -1, g[i][j] = -1;
  for (int i = 1; i <= n; i++) {
    vector<int> vis(n + 1, 0);
    vis[i] = 1;
    for (int a = 0; a < graph[i].size(); a++) {
      vector<int> q = {graph[i][a]};
      for (int j = 0; j < q.size(); j++) {
        int v = q[j];
        f[i][v] = a;
        for (auto u : graph[v])
          if (!vis[u]) vis[u] = 1, q.push_back(u);
      }
    }
  }
  for (int i = 1; i <= n; i++) {
    vector<int> vis(n + 1, 0);
    vis[i] = 1;
    for (int a = (int)graph[i].size() - 1; a >= 0; a--) {
      vector<int> q = {graph[i][a]};
      for (int j = 0; j < q.size(); j++) {
        int v = q[j];
        g[i][v] = a;
        for (auto u : graph[v])
          if (!vis[u]) vis[u] = 1, q.push_back(u);
      }
    }
  }
  for (int i = 0; i < m; i++) {
    int id = glina[i];
    int v = fr[i], u = to[i];
    int fl = (f[v][u] != -1 && f[v][u] != id);
    fl |= (g[v][u] != -1 && g[v][u] != id);
    if (fl ^ go[u][v])
      cout << "diff\n";
    else
      cout << "same\n";
  }
}
