#include <bits/stdc++.h>
using namespace std;
namespace std {
template <class S, class T>
struct hash<pair<S, T>> {
  size_t operator()(const pair<S, T> &p) const {
    return ((size_t)1e9 + 7) * hash<S>()(p.first) + hash<T>()(p.second);
  }
};
template <class T>
struct hash<vector<T>> {
  size_t operator()(const vector<T> &v) const {
    size_t h = 0;
    for (auto i : v) h = h * ((size_t)1e9 + 7) + hash<T>()(i) + 1;
    return h;
  }
};
}  // namespace std
template <class T>
ostream &operator<<(ostream &os, const vector<T> &v) {
  os << "[ ";
  for (int i = 0; i < (int)v.size(); i++)
    os << v[i] << (i == v.size() - 1 ? " ]" : ", ");
  return os;
}
template <class T>
ostream &operator<<(ostream &os, const set<T> &v) {
  os << "{ ";
  for (const auto &i : v) os << i << ", ";
  return os << "}";
}
template <class T, class U>
ostream &operator<<(ostream &os, const map<T, U> &v) {
  os << "{";
  for (const auto &i : v) os << " " << i.first << ": " << i.second << ",";
  return os << "}";
}
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
  return os << "(" << p.first << ", " << p.second << ")";
}
void dbgprint(const string &fmt) { cerr << endl; }
template <class H, class... T>
void dbgprint(const string &fmt, const H &h, const T &...r) {
  cerr << fmt.substr(0, fmt.find(",")) << "= " << h << " ";
  dbgprint(fmt.substr(fmt.find(",") + 1), r...);
}
const int inf = (int)1e9;
const double INF = 1e12, EPS = 1e-9;
int n, m;
bool can[1000][1000], can2[1000][1000];
vector<vector<int>> e;
void rec1(bool *v, int c) {
  v[c] = 1;
  for (int i : e[c])
    if (!v[i]) rec1(v, i);
}
int main() {
  cin.tie(0);
  cin.sync_with_stdio(0);
  cin >> n >> m;
  assert(n > 2);
  e.resize(n);
  map<pair<int, int>, int> id;
  for (int i = 0; i < (int)m; i++) {
    int a, b;
    cin >> a >> b;
    a--;
    b--;
    e[a].push_back(b);
    id[pair<int, int>(a, b)] = i;
  }
  for (int i = 0; i < (int)n; i++) sort((e[i]).begin(), (e[i]).end());
  for (int i = 0; i < (int)n; i++) rec1(can[i], i);
  for (int i = 0; i < (int)n; i++)
    for (int it = 0; it < (int)2; it++) {
      bool v[1000] = {};
      v[i] = 1;
      for (int j : e[i]) {
        if (v[j]) can2[i][j] = 1;
        rec1(v, j);
      }
      reverse((e[i]).begin(), (e[i]).end());
    }
  const char *res[] = {"diff", "same"};
  vector<int> ans(m);
  for (auto i : id) {
    int a = i.first.first, b = i.first.second;
    ans[i.second] = can2[a][b] ? can[b][a] : !can[b][a];
  }
  for (int i = 0; i < (int)m; i++) cout << res[ans[i]] << endl;
  return 0;
}
