#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
#define endl '\n'
#define fi first
#define se second
#define int long long

using namespace std;

const int MAXN=1e6+5;

int n,m;
string s[MAXN];
vector<vector<bool> > v;
vector<vector<pair<bool,bool> > > orr;

bool getOr(int i,int j,int pos)
{
    if(i<0 || j<0) return 0;
    if(pos==0)
    {
        if(s[i][j]!='1') return orr[i][j].fi;
        else return orr[i][j].se;
    }
    if(s[i][j]!='1') return orr[i][j].se;
    return orr[i][j].fi;
}

signed main()
{
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);

freopen("note.in","r",stdin);
freopen("note.out","w",stdout);

cin>>n>>m;
for(int i=0;i<n;i++) cin>>s[i];

if(n==1 && m==1) {cout<<"K"<<endl; return 0;}

v.resize(n, vector<bool>(m,0));
orr.resize(n, vector<pair<bool,bool> >(m,{0,0}));

//v[0][0]=1;
for(int i=0;i<n;i++)
{
    for(int j=0;j<m;j++)
    {
        //if(i==0 && j==0) continue;
        if(s[i][j]!='1' && s[i][j]!='L')
        {
            bool x=getOr(i,j-1,0);
            bool y=getOr(i-1,j,1);
            if(x|y) v[i][j]=0;
            else v[i][j]=1;
            orr[i][j].fi=x|v[i][j];
            orr[i][j].se=y|v[i][j];
        }
        else if(s[i][j]=='1')
        {
            bool x=getOr(i,j-1,0);
            bool y=getOr(i-1,j,1);
            orr[i][j].fi=x;
            orr[i][j].se=y;
        }
        else
        {
            bool x=getOr(i,j-1,0);
            bool y=getOr(i-1,j,1);
            if(x|y) cout<<"L"<<endl;
            else cout<<"K"<<endl;
            return 0;
        }
    }
}

return 0;
}