#include <bits/stdc++.h>
using namespace std;
class pa3 {
 public:
  long long x;
  long long y, z;
  pa3(long long x = 0, long long y = 0, long long z = 0) : x(x), y(y), z(z) {}
  bool operator<(const pa3 &p) const {
    if (x != p.x) return x < p.x;
    if (y != p.y) return y < p.y;
    return z < p.z;
  }
  bool operator>(const pa3 &p) const {
    if (x != p.x) return x > p.x;
    if (y != p.y) return y > p.y;
    return z > p.z;
  }
  bool operator==(const pa3 &p) const {
    return x == p.x && y == p.y && z == p.z;
  }
  bool operator!=(const pa3 &p) const {
    return !(x == p.x && y == p.y && z == p.z);
  }
};
class pa4 {
 public:
  long long x;
  long long y, z, w;
  pa4(long long x = 0, long long y = 0, long long z = 0, long long w = 0)
      : x(x), y(y), z(z), w(w) {}
  bool operator<(const pa4 &p) const {
    if (x != p.x) return x < p.x;
    if (y != p.y) return y < p.y;
    if (z != p.z) return z < p.z;
    return w < p.w;
  }
  bool operator>(const pa4 &p) const {
    if (x != p.x) return x > p.x;
    if (y != p.y) return y > p.y;
    if (z != p.z) return z > p.z;
    return w > p.w;
  }
  bool operator==(const pa4 &p) const {
    return x == p.x && y == p.y && z == p.z && w == p.w;
  }
};
class pa2 {
 public:
  long long x, y;
  pa2(long long x = 0, long long y = 0) : x(x), y(y) {}
  pa2 operator+(pa2 p) { return pa2(x + p.x, y + p.y); }
  pa2 operator-(pa2 p) { return pa2(x - p.x, y - p.y); }
  bool operator<(const pa2 &p) const { return y != p.y ? y < p.y : x < p.x; }
  bool operator>(const pa2 &p) const { return x != p.x ? x < p.x : y < p.y; }
  bool operator==(const pa2 &p) const {
    return abs(x - p.x) == 0 && abs(y - p.y) == 0;
  }
  bool operator!=(const pa2 &p) const {
    return !(abs(x - p.x) == 0 && abs(y - p.y) == 0);
  }
};
class Point {
 public:
  double x, y;
  Point(double x = 0, double y = 0) : x(x), y(y) {}
  Point operator+(Point p) { return Point(x + p.x, y + p.y); }
  Point operator-(Point p) { return Point(x - p.x, y - p.y); }
  Point operator*(double a) { return Point(x * a, y * a); }
  Point operator/(double a) { return Point(x / a, y / a); }
  double absv() { return sqrt(norm()); }
  double norm() { return x * x + y * y; }
  bool operator<(const Point &p) const { return x != p.x ? x < p.x : y < p.y; }
  bool operator==(const Point &p) const {
    return fabs(x - p.x) < (1e-10) && fabs(y - p.y) < (1e-10);
  }
};
struct Segment {
  Point p1, p2;
};
double dot(Point a, Point b) { return a.x * b.x + a.y * b.y; }
double cross(Point a, Point b) { return a.x * b.y - a.y * b.x; }
bool parareru(Point a, Point b, Point c, Point d) {
  return abs(cross(a - b, d - c)) < (1e-10);
}
double distance_ls_p(Point a, Point b, Point c) {
  if (dot(b - a, c - a) < (1e-10)) return (c - a).absv();
  if (dot(a - b, c - b) < (1e-10)) return (c - b).absv();
  return abs(cross(b - a, c - a)) / (b - a).absv();
}
bool is_intersected_ls(Segment a, Segment b) {
  if (a.p1 == b.p1 || a.p2 == b.p1 || a.p1 == b.p2 || a.p2 == b.p2)
    return false;
  if (parareru((a.p2), (a.p1), (a.p1), (b.p2)) &&
      parareru((a.p2), (a.p1), (a.p1), (b.p1))) {
    if (dot(a.p1 - b.p1, a.p1 - b.p2) < (1e-10)) return true;
    if (dot(a.p2 - b.p1, a.p2 - b.p2) < (1e-10)) return true;
    if (dot(a.p1 - b.p1, a.p2 - b.p1) < (1e-10)) return true;
    if (dot(a.p1 - b.p2, a.p2 - b.p2) < (1e-10)) return true;
    return false;
  } else
    return (cross(a.p2 - a.p1, b.p1 - a.p1) * cross(a.p2 - a.p1, b.p2 - a.p1) <
            (1e-10)) &&
           (cross(b.p2 - b.p1, a.p1 - b.p1) * cross(b.p2 - b.p1, a.p2 - b.p1) <
            (1e-10));
}
double segment_dis(Segment a, Segment b) {
  if (is_intersected_ls(a, b)) return 0;
  double r = distance_ls_p(a.p1, a.p2, b.p1);
  r = min(r, distance_ls_p(a.p1, a.p2, b.p2));
  r = min(r, distance_ls_p(b.p1, b.p2, a.p2));
  r = min(r, distance_ls_p(b.p1, b.p2, a.p1));
  return r;
}
Point intersection_ls(Segment a, Segment b) {
  Point ba = b.p2 - b.p1;
  double d1 = abs(cross(ba, a.p1 - b.p1));
  double d2 = abs(cross(ba, a.p2 - b.p1));
  double t = d1 / (d1 + d2);
  return a.p1 + (a.p2 - a.p1) * t;
}
string itos(long long i) {
  ostringstream s;
  s << i;
  return s.str();
}
long long gcd(long long v, long long b) {
  if (v > b) return gcd(b, v);
  if (v == b) return b;
  if (b % v == 0) return v;
  return gcd(v, b % v);
}
double distans(double x1, double y1, double x2, double y2) {
  double rr = (x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2);
  return sqrt(rr);
}
long long mod;
long long extgcd(long long a, long long b, long long &x, long long &y) {
  if (b == 0ll) {
    x = 1ll;
    y = 0ll;
    return a;
  }
  long long d = extgcd(b, a % b, y, x);
  y -= a / b * x;
  return d;
}
pair<long long, long long> operator+(const pair<long long, long long> &l,
                                     const pair<long long, long long> &r) {
  return {l.first + r.first, l.second + r.second};
}
pair<long long, long long> operator-(const pair<long long, long long> &l,
                                     const pair<long long, long long> &r) {
  return {l.first - r.first, l.second - r.second};
}
long long pr[200010];
long long inv[200010];
long long beki(long long wa, long long rr, long long warukazu) {
  if (rr == 0) return 1 % warukazu;
  if (rr == 1) return wa % warukazu;
  wa %= warukazu;
  if (rr % 2 == 1)
    return ((long long)beki(wa, rr - 1, warukazu) * (long long)wa) % warukazu;
  long long zx = beki(wa, rr / 2, warukazu);
  return (zx * zx) % warukazu;
}
double bekid(double w, long long r) {
  if (r == 0) return 1.0;
  if (r == 1) return w;
  if (r % 2) return bekid(w, r - 1) * w;
  double f = bekid(w, r / 2);
  return f * f;
}
long long comb(long long nn, long long rr) {
  long long r = pr[nn] * inv[rr];
  r %= mod;
  r *= inv[nn - rr];
  r %= mod;
  return r;
}
void gya(long long ert) {
  pr[0] = 1;
  for (long long i = 1; i <= ert; i++) {
    pr[i] = (pr[i - 1] * i) % mod;
  }
  inv[ert] = beki(pr[ert], mod - 2, mod);
  for (long long i = ert - 1; i >= 0; i--) inv[i] = inv[i + 1] * (i + 1) % mod;
}
vector<long long> gr[1100];
vector<long long> igr[1100];
vector<long long> ban;
long long V, e;
long long visit[1100] = {0}, gro[1100] = {0};
void dfs(long long i) {
  if (visit[i] == 0) {
    visit[i] = 1;
    for (long long k = 0; k < gr[i].size(); k++) dfs(gr[i][k]);
    ban.push_back(i);
  }
}
void idfs(long long i, long long h) {
  if (visit[i] == 0) {
    visit[i] = 1;
    gro[i] = h;
    for (long long k = 0; k < igr[i].size(); k++) idfs(igr[i][k], h);
  }
}
void kyouren() {
  for (long long i = 0; i < V; i++) {
    dfs(i);
  }
  for (long long i = 0; i < V; i++) visit[i] = 0;
  for (long long i = V - 1; i >= 0; i--) {
    idfs(ban[i], ban[i]);
  }
}
vector<pair<long long, long long> > eda;
map<pair<long long, long long>, long long> ma;
vector<pair<long long, long long> > naibu[1100];
long long GG[1100][1100] = {};
vector<pair<long long, long long> > G[1100];
vector<pair<long long, long long> > H[1100];
vector<long long> G2[1100];
long long owari[1100] = {};
long long ans[200020] = {};
long long tmp[1100];
long long sumi[1100];
long long dfs1(long long r, long long p) {
  if (sumi[r]) return tmp[r];
  sumi[r] = 1;
  if (r == p) {
    tmp[r] = 0;
  } else {
    long long ima = -100;
    for (auto v : G2[r]) ima = max(ima, dfs1(v, p));
    ima++;
    if (ima < 0)
      tmp[r] = -100;
    else
      tmp[r] = ima;
  }
  return tmp[r];
}
void dagdag(long long r, long long n) {
  for (long long i = 0; i < n; i++) sumi[i] = 0;
  for (auto v : G[r]) {
    if (v.second == -1) continue;
    if (dfs1(v.first, r) > 1)
      ans[v.second] = 2;
    else
      ans[v.second] = 1;
  }
}
vector<long long> cho[1010];
vector<long long> T[1010];
vector<long long> T2[1010];
long long dfs2(long long r, long long p, long long mae) {
  if (sumi[r]) return tmp[r];
  sumi[r] = 1;
  if (r == p) {
    tmp[r] = 0;
  } else {
    long long ima = -100;
    for (auto v : T2[r])
      if (v != mae) ima = max(ima, dfs2(v, p, r));
    ima++;
    if (ima < 0)
      tmp[r] = -100;
    else
      tmp[r] = ima;
  }
  return tmp[r];
}
long long vis[1100];
void ddff(long long r) {
  if (vis[r]) return;
  vis[r] = 1;
  for (auto v : T[r])
    if (!vis[v]) ddff(v);
}
void uti(long long r, long long n) {
  for (auto v : cho[r]) {
    if (T[v].size() == 1) {
      ans[ma[{v, T[v][0]}]] = 2;
    } else {
      long long f = T[v].size();
      vector<long long> ve(f, 0);
      for (long long i = 0; i < n; i++) vis[i] = 0;
      vis[v] = 1;
      for (long long i = 0; i < f; i++) {
        if (vis[T[v][i]]) ve[i] = 1;
        ddff(T[v][i]);
      }
      for (long long i = 0; i < n; i++) vis[i] = 0;
      vis[v] = 1;
      for (long long i = f - 1; i >= 0; i--) {
        if (vis[T[v][i]]) ve[i] = 1;
        ddff(T[v][i]);
      }
      for (long long i = 0; i < f; i++) {
        if (ve[i])
          ans[ma[{v, T[v][i]}]] = 1;
        else
          ans[ma[{v, T[v][i]}]] = 2;
      }
    }
  }
}
signed main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  long long n, m;
  cin >> n >> m;
  V = n;
  for (long long i = 0; i < m; i++) {
    long long y, yy;
    cin >> y >> yy;
    y--;
    yy--;
    ma[{y, yy}] = i;
    eda.push_back({y, yy});
    gr[y].push_back(yy);
    igr[yy].push_back(y);
  }
  kyouren();
  for (long long i = 0; i < n; i++) cho[gro[i]].push_back(i);
  for (long long i = 0; i < m; i++) {
    pair<long long, long long> v = eda[i];
    if (gro[v.first] == gro[v.second]) {
      naibu[gro[v.first]].push_back(v);
      T[v.first].push_back(v.second);
      T2[v.second].push_back(v.first);
    } else {
      GG[gro[v.first]][gro[v.second]]++;
      H[gro[v.first]].push_back({gro[v.second], i});
    }
  }
  for (long long i = 0; i < n; i++) {
    for (auto v : H[i]) {
      if (GG[i][v.first] == 1) {
        G[i].push_back(v);
      } else {
        ans[v.second] = 1;
      }
    }
    for (auto v : H[i]) {
      if (GG[i][v.first] > 1) {
        G[i].push_back(v);
        G[i].back().second = -1;
        GG[i][v.first] = 0;
      }
    }
  }
  for (long long i = 0; i < n; i++)
    for (auto v : G[i]) {
      G2[v.first].push_back(i);
    }
  for (long long i = 0; i < n; i++)
    if (!owari[i]) {
      dagdag(i, n);
    }
  for (long long i = 0; i < n; i++)
    if (naibu[i].size()) uti(i, n);
  for (long long i = 0; i < m; i++)
    cout << (ans[i] == 1 ? "same" : "diff") << endl;
  return 0;
}
