// Slower C++ solution:
#include <bits/stdc++.h>

using namespace std;



namespace SCC {

	const int N = 110000;

	vector<int> con[N], rcon[N];

	int n, vis[N], visT;

	int id[N], idn;

	void init(int nn = 0) {

		n = nn, visT = idn = 0;

		for (int i = 1; i <= n; i++) con[i].clear(), rcon[i].clear();

	}

	void add_edge(int u, int v) {

		con[u].push_back(v);

		rcon[v].push_back(u);

	}

	void dfs(int u) {

		vis[u] = 1;

		for (int v : con[u]) if (!vis[v]) dfs(v);

		id[idn++] = u;

	}

	void rdfs(int u) {

		vis[u] = visT;

		for (int v : rcon[u]) if (!vis[v]) rdfs(v);

	}

	void SCC() {

		for (int i = 1; i <= n; i++) vis[i] = 0;

		for (int i = 1; i <= n; i++) if (!vis[i]) dfs(i);

		for (int i = 1; i <= n; i++) vis[i] = 0;

		for (int i = idn - 1; i >= 0; i--) if (!vis[id[i]]) visT++, rdfs(id[i]);

	}

};



const int N = 1100;

const int M = 220000;



vector<int> con[N];



struct Edge {

	int u, v;

	Edge(int u = 0, int v = 0) : u(u), v(v) {}

} E[M];



int adj[N][N];

int vis[N], visT;

int son[2][N][N];



inline bool Find(int u, int tar) {

	if (adj[u][tar] > 1) return true;

	return son[0][u][tar] != tar || son[1][u][tar] != tar;

}



void dfs(int u, int id, int rt, int __rt) {

	vis[u] = visT;

	son[id][__rt][u] = rt;

	for (int v : con[u]) if (vis[v] != visT) dfs(v, id, rt, __rt);

}



void init(int n) {

	for (int i = 1; i <= n; i++) {

		visT++;

		vis[i] = visT;

		for (int v : con[i]) if (vis[v] != visT) dfs(v, 0, v, i);

		reverse(con[i].begin(), con[i].end());

		visT++;

		vis[i] = visT;

		for (int v : con[i]) if (vis[v] != visT) dfs(v, 1, v, i);

	}

}



int main() {

	

	ios::sync_with_stdio(0);

	cin.tie(0), cout.tie(0);

	

	int n, m; cin >> n >> m;

	SCC::init(n + 10);

	for (int i = 0; i < m; i++) {

		int u, v; cin >> u >> v;

		E[i] = Edge(u, v);

		con[u].push_back(v);

		adj[u][v]++;

		SCC::add_edge(u, v);

	}

	SCC::SCC();

	

	init(n);

	

	for (int i = 0; i < m; i++) {

		auto a = SCC::vis[E[i].u], b = SCC::vis[E[i].v];

		if (a == b) {

			if (Find(E[i].u, E[i].v)) cout << "same\n";

			else cout << "diff\n";

		} else {

			if (Find(E[i].u, E[i].v)) cout << "diff\n";

			else cout << "same\n";

		}

	}

	

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 8.817051107059328x):
#include<cstdio>

#include<cstring>

#include<iostream>

#include<vector>

using namespace std; 

const int maxn=1000+50;

const int maxm=200000+50;

int N,M;

int p[maxn];

int q[maxn];

int c[maxn][maxn];

bool an[maxm];

struct edge

{

	int to,id;

	edge(int to=0,int id=0):to(to),id(id){}

};

vector<edge> adj[maxn];

void dfs(int u,int root)

{

	if(c[root][u]) return;

	c[root][u]=1;

	for(unsigned int i=0;i<adj[u].size();++i)

	{

		int v=adj[u][i].to;

		dfs(v,root); 

	}

}

void dfs(int u,int c,int *p)

{

	if(p[u]!=-1) return;

	p[u]=c;

	for(unsigned int i=0;i<adj[u].size();++i)

	{

		int v=adj[u][i].to;

		dfs(v,c,p);

	}

}

void solve()

{

	for(int i=1;i<=N;++i)

	{

		dfs(i,i);

	}

	for(int u=1;u<=N;++u)

	{

		memset(p,-1,sizeof(p));

		memset(q,-1,sizeof(q));

		int l=p[u]=q[u]=adj[u].size();

		for(int i=0;i<l;++i)

		{

			int v=adj[u][i].to;

			dfs(v,i,p);

		}

		for(int i=l-1;~i;--i)

		{

			int v=adj[u][i].to;

			dfs(v,i,q);

		}

		for(int i=0;i<l;++i)

		{

			int v=adj[u][i].to;

			int d=adj[u][i].id;

			an[d]=c[v][u]^(p[v]!=i||q[v]!=i);

		}

	}

}

int main()

{

	scanf("%d%d",&N,&M);

	for(int i=1;i<=M;++i)

	{

		int a,b;

		scanf("%d%d",&a,&b);

		adj[a].push_back(edge(b,i));

	}

	solve();

	for(int i=1;i<=M;++i)

	{

		puts(an[i]?"diff":"same");

	}

	return 0;

}