//Create Time: 2018-04-27 20:30:30
#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <cmath>
#include <algorithm>
#include <vector>
#include <cstdlib>
#include <sstream>
#include <fstream>
#include <functional>
#include <list>
#include <deque>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <bitset>
#include <cctype>
#include <ctime>
#include <utility>
#include <complex>
#include <cassert>
#include <climits>
#include <iterator>
#include <tuple>
using namespace std;
#define snuke(i,x) for (__typeof((x).begin()) i = (x).begin(); i != (x).end(); ++i)
#define rep(i,a,n) for (int i=(a);i<(n);i++)
#define per(i,n,a) for (int i=(n)-1;i>=(a);i--)
// #define OUT(x) std::cout<<(#x)<<":"<<(x)<<std::endl
// #define TST(x) std::cout<<(#x)<<":"<<(x)<<" "
#define OUT(args...) {string _s=#args;replace(_s.begin(),_s.end(),',',' ');stringstream _ss(_s);istream_iterator<string> _it(_ss);OUT_TST("\n",_it,args);}
#define TST(args...) {string _s=#args;replace(_s.begin(),_s.end(),',',' ');stringstream _ss(_s);istream_iterator<string> _it(_ss);OUT_TST("",_it,args);}
#define SZ(v) ((int)(v).size())
#define all(v) (v).begin(), (v).end()
#define unq(x) sort(all(x)),(x).erase(unique(all(x)),(x).end())
#define mem(f,x) memset((f), (x), sizeof(f))
#define clr(f) mem(f,0)
#define x first
#define y second
#define mp make_pair
#define pb push_back
#define mt make_tuple
#define eb emplace_back
#define DEBUG
void OUT_TST(string s,istream_iterator<string> it) {cerr<<s;}
template<typename T, typename... Args> void OUT_TST(string s,istream_iterator<string> it,T a,Args... args){cerr<<*it<<"="<<a<<" ";OUT_TST(s,++it,args...);}
template<class T> void rd(T&ret){ret=0;bool ok=0,u=0;for(;;){int c=getchar();if(c>='0'&&c<='9')ret=(ret<<3)+(ret<<1)+c-'0',ok=1;else if(c=='-')u=1;else if(ok){if(u)ret*=-1;return;}}}
long long powmod(long long p,long long n,long long mod){long long ret=1;for(;n;n>>=1){if(n&1)ret=ret*p%mod;p=p*p%mod;}return ret;}
template <class T> bool chmin(T& a, const T &b) {return b < a? a = b, 1: 0;}
template <class T> bool chmax(T& a, const T &b) {return b > a? a = b, 1: 0;}
int gcd(int a,int b){return b?gcd(b,a%b):a;}
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pii > vii;
typedef tuple<int,int,int> tp;
/****head****/
const int N=1111;
const int M=211111;
vii eg[N];
pii an[M];
int fg,start,p[N],q[N];
bool vis[N][N],can[N][N];
void dfs(int u){
    if(vis[start][u])return;
    vis[start][u]=1;
    for(auto j:eg[u])dfs(j.x);
}
void gao(int u,int *f){
    if(u==start)return;
    if(f[u]!=0)return;
    f[u]=fg;
    for(auto j:eg[u])gao(j.x,f);
}
int main(){
    int n,m;cin>>n>>m;
    rep(i,0,m){
        int a,b;
        scanf("%d%d",&a,&b);--a;--b;
        an[i]={a,b};
        eg[a].eb(b,i);
    }
    rep(i,0,n){start=i;dfs(i);}
    rep(i,0,n){
        clr(p);clr(q);
        fg=0;
        start=i;
        for(auto j:eg[i]){
            ++fg;
            gao(j.x,p);
        }
        per(j,SZ(eg[i]),0){
            gao(eg[i][j].x,q);
            --fg;
        }
        int t=0;
        for(auto j:eg[i]){
            ++t;
            if(p[j.x]!=t || q[j.x]!=t)can[i][j.x]=1;
        }
    }
    rep(i,0,m){
        int x,y;tie(x,y)=an[i];
        // OUT(x,y,can[x][y],vis[y][x]);
        if(can[x][y]==vis[y][x])puts("same");
        else puts("diff");
    }
    return 0;
}


Measured memory_bytes: 8192