#include <bits/stdc++.h>
using namespace std;
//-1 没做过，0：先手必败，1：先手必胜
int book[1005][1005];
bool dfs(int x, int y)
{
    if (x < y)
        swap(x, y);
    // x >= y
    if (book[x][y] != -1)
        return book[x][y];
    if (y == 0)
        return book[x][y] = false;
    if (x % y == 0)
        return book[x][y] = true;
    // 枚举从x里拿走多少
    bool flag = true; //后续状态全都是先手必胜态
    for (int i = y; i <= x; i += y)
        if (!dfs(x - i, y))
            return book[x][y] = true;
    return book[x][y] = false;
}
int main()
{
    memset(book, -1, sizeof(book));
    int x, y;
    while (cin >> x >> y)
    {
        if (x == 0 && y == 0)
            break;
        if (dfs(x, y))
            cout << "win\n";
        else
            cout << "lose\n";
    }
    return 0;
}