#include <bits/stdc++.h>
#define MOD 998244353
#define mod 1000000007
#define ll long long
#define rr(i,j,a,b,c,d) for (int i = a; i < b; i++){for (int j = c; j < d; j++)}
using namespace std;
const int maxn = 1e6+9;
int main()
{
int n,m,i,j,k,l,sum1 = 0,sum2 = 0;
cin >> n >> m;
char a[n][m];
rr(i,j,0,n,0,m)
{
cin >> a[i][j];
if (a[i][j] == '*') sum1++;
else if (a[i][j] == '$') sum2++;
}
rr(k,l,0,n,0,m)
{
int cnt = 0;
for (int o = 0; o < m; o++)
{
if (a[l][o] == '*')
cnt++;
}
if (cnt == 5)
{
cout << "Pleasing!\n";
return 0;
}
}
rr(k,l,0,n,0,m)
{
int cnt = 0;
for (int o = 0; o < m; o++)
{
if (a[o][l] == '*')
cnt++;
}
if (cnt == 5)
{
cout << "Pleasing!\n";
return 0;
}
}
int cnt = 0;
for (int o = 0; o < n; o++)
{
if (a[o][o] == '*')
cnt++;
}
if (cnt == 5)
{
cout << "Pleasing!\n";
return 0;
}
cnt = 0;
for (int o = 0,p = n - 1; o != n - 1 && p; o++,p--)
{
if (a[o][p] == '*')
cnt++;
}
if (cnt == 5)
{
cout << "Pleasing!\n";
return 0;
}
rr(k,l,0,n,0,m)
{
int cnt = 0;
for (int o = 0; o < m; o++)
{
if (a[l][o] == '$')
cnt++;
}
if (cnt == 5)
{
cout << "zylwins!\n";
return 0;
}
}
rr(k,l,0,n,0,m)
{
int cnt = 0;
for (int o = 0; o < m; o++)
{
if (a[o][l] == '$')
cnt++;
}
if (cnt == 5)
{
cout << "zylwins!\n";
return 0;
}
}
cnt = 0;
for (int o = 0; o < n; o++)
{
if (a[o][o] == '$')
cnt++;
}
if (cnt == 5)
{
cout << "zylwins!\n";
return 0;
}
cnt = 0;
for (int o = 0,p = n - 1; o != n - 1 && p; o++,p--)
{
if (a[o][p] == '*')
cnt++;
}
if (cnt == 5)
{
cout << "zylwins!\n";
return 0;
}
cout << (sum1 > sum2 ? 'Z' : 'W');
return 0;
}