const int LG = 21;
const int FN = 400005;
const long long MOD = 1e9 + 7;
const long long INF = 1e9;
const long long INFLL = 1e18;

#include <iostream>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <algorithm>
#include <cmath>
#include <time.h>
#include <unordered_set>
#include <bitset>
#include <deque>

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<ll> vi;

#define forn(i, n) for (int (i) = 0; (i) != (n); (i)++)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define popcount(x) __builtin_popcount(x)
#define popcountll(x) __builtin_popcountll(x)
#define fi first
#define se second
#define re return
#define uniq(x) sort(all(x)); (x).resize(unique(all(x)) - (x).begin())

#ifdef LOCAL
#define dbg(x) cerr << __LINE__ << " " << #x << " " << x << endl
#define ln cerr << __LINE__ << endl
#else
#define dbg(x) void(0)
#define ln void(0)
#endif // LOCAL

int cx[4] = {-1, 0, 1, 0};
int cy[4] = {0, -1, 0, 1};

ll inq(ll x, ll y)
{
    if (!y) re 1 % MOD;
    ll l = inq(x, y / 2);
    if (y % 2) re l * l % MOD * x % MOD;
    re l * l % MOD;
}

ll rev(ll x)
{
    return inq(x, MOD - 2);
}

bool __precomputed_combinatorics = 0;
vector<ll> __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;
}

ll fact(int x)
{
    if (!__precomputed_combinatorics) __precompute_combinatorics();
    return __fact[x];
}

ll 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 = 201010;
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;
    forn(i, m)
    {
        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++)
        {
            if (vis[graph[i][a]]) continue;
            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--)
        {
            if (vis[graph[i][a]]) continue;
            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";
    }
}

/* Note:
Check constants at the beginning of the code.
    N is set to 4e5 but be careful in problems with large constant factor.
    Setting N in every problem is more effective.
Check corner cases.
    N = 1
No def int long long for now.
Add something here.
*/


Measured memory_bytes: 17152