#include <iostream>

#include <cstring>

#include <string>

#include <queue>

#include <vector>

#include <map>

#include <set>

#include <stack>

#include <cmath>

#include <cstdio>

#include <algorithm>

#include <iomanip>

#define N 1010

#define LL __int64

#define inf 0x3f3f3f3f

#define lson l,mid,ans<<1

#define rson mid+1,r,ans<<1|1

#define getMid (l+r)>>1

#define movel ans<<1

#define mover ans<<1|1

using namespace std;

const LL mod = ;

int n, m;

bool flag[N][N];

int cnt;

vector<int> mapp[N];

bool vis[N];

void dfs(int u) {

    for (int i = ; i < mapp[u].size(); i++) {

        int v = mapp[u][i];

        if (!vis[v]) {

            flag[cnt][v] = true;

            flag[v][cnt] = true;

            vis[v] = true;

            dfs(v);

        }

    }

}

void solve(int u) {

    memset(vis, false, sizeof(vis));

    vis[u] = true;

    cnt = u;

    dfs(u);

    flag[u][u] = ;

}

void init() {

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

        mapp[i].clear();

    }

    memset(flag, false, sizeof(flag));

}

int main() {

    cin.sync_with_stdio(false);

    int T;

    int a, b;

    cin >> T;

    while (T--) {

        cin >> n >> m;

        init();

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

            cin >> a >> b;

            mapp[a].push_back(b);

        }

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

            solve(i);

        }

        cnt = ;

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

            for (int j = ; j <= n; j++) {

                if (flag[i][j] == false) {

                    cnt = ;

                }

            }

        }

        if (!cnt) {

            cout << "I love you my love and our love save us!" << endl;

        }

        else {

            cout << "Light my fire!" << endl;

        }

    }

    return ;

}