#include <cstdio>
#include <iostream>
#include <string>
#include <cmath>
#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <vector>
#include <queue>
#include <math.h>
#include <stack>
using namespace std;
string s;
int a[100001];
int main()
{
    int n, k;
    int op=0;
    cin >> n >> k;
    while (n--)
    {
        op=0;
        memset(a, 0, sizeof(a));
        long long cnt = 1;
        cin >> s;
        int len1 = s.length();
        for (int i = 1; i <= len1; i++)
        {
            if(op==0){
            a[i] = s[len1 - i] - '0';
            cnt *= a[i];
            if (cnt > k)
            {
            op=1;   
            }
        }
        }
        if (cnt <= k)
        {
            cout << "kawaii" << endl;
        }
        else
        {
            cout << "dame" << endl;
        }
    }
    return 0;
}