//Author: xiaowuga
#include <iostream>
#include <algorithm>
#include <set>
#include <vector>
#include <queue>
#include <cmath>
#include <cstring>
#include <cstdio>
#include <ctime>
#include <map>
#include <bitset>
#include <cctype>
#define maxx INT_MAX
#define minn INT_MIN
#define inf 0x3f3f3f3f
#define mem(s,ch) memset(s,ch,sizeof(s))
#define da cout<<da<<endl
#define uoutput(a,i,l,r) for(int i=l;i<r;i++) if(i==l) cout<<a[i];else cout<<" "<<a[i];cout<<endl;
#define doutput(a,i,l,r) for(int i=r-1;i>=0;i--) if(i==r-1) cout<<a[i];else cout<<" "<<a[i];cout<<endl;
const long long N=80000;
using namespace std;
typedef long long LL;
int main() {ios::sync_with_stdio(false);cin.tie(0);int T,n,x,y;char q1[N],q2[N];cin>>T;while(T--){cin>>n>>x>>y;cin>>q1>>q2;int ct=0;for(int i=0;i<n;i++) if(q1[i]==q2[i]) ct++;int l=x+y-n;int r=n-max(x,y)+min(x,y);if(ct>=l&&ct<=r) cout<<"Not lying"<<endl;else cout<<"Lying"<<endl; }return 0;
}

 1 //Author: xiaowuga
 2 #include <iostream>
 3 #include <algorithm>
 4 #include <set>
 5 #include <vector>
 6 #include <queue>
 7 #include <cmath>
 8 #include <cstring>
 9 #include <cstdio>
10 #include <ctime>
11 #include <map>
12 #include <bitset>
13 #include <cctype>
14 #define maxx INT_MAX
15 #define minn INT_MIN
16 #define inf 0x3f3f3f3f
17 #define mem(s,ch) memset(s,ch,sizeof(s))
18 #define da cout<<da<<endl
19 #define uoutput(a,i,l,r) for(int i=l;i<r;i++) if(i==l) cout<<a[i];else cout<<" "<<a[i];cout<<endl;
20 #define doutput(a,i,l,r) for(int i=r-1;i>=0;i--) if(i==r-1) cout<<a[i];else cout<<" "<<a[i];cout<<endl;
21 const long long N=250000;
22 const long long mod=1e9+7;
23 using namespace std;
24 typedef long long LL;
25 struct Node{
26     LL val,pos;
27     bool operator <(const Node &m) const{
28         if(val!=m.val) return val<m.val;
29         else{
30             return pos>=m.pos;
31         }
32     }
33 };
34 LL a[2*N],b[N];
35 LL n;
36 priority_queue<Node>q;
37 int main() {
38     ios::sync_with_stdio(false);cin.tie(0);
39     while(cin>>n){
40         while(!q.empty()) q.pop();
41         for(int i=1;i<=n;i++){
42             cin>>a[i];
43             q.push((Node){a[i]-i,i});
44         }
45         for(int i=1;i<=n;i++) cin>>b[i]; sort(b+1,b+n+1);
46         int cur=1;
47         for(LL i=n+1;i<=2*n;i++){
48             Node t=q.top();
49             while(b[cur]>t.pos){
50                 q.pop();
51                 t=q.top();
52             }
53             t=q.top();
54             a[i]=t.val;
55             q.push((Node){a[i]-i,i});
56             cur++;
57         }
58         LL sum=0;
59         for(int i=n+1;i<=2*n;i++) sum=(sum+a[i])%mod;
60         cout<<sum<<endl;
61
62     }
63     return 0;
64 }

 1 //Author:xiaowuga
 2 #include <iostream>
 3 #include <algorithm>
 4 #include <set>
 5 #include <vector>
 6 #include <queue>
 7 #include <cmath>
 8 #include <cstring>
 9 #include <cstdio>
10 #include <ctime>
11 #include <map>
12 #include <bitset>
13 #define mem(s,ch) memset(s,ch,sizeof(s))
14 #define da cout<<da<<endl
15 #define uoutput(a,i,l,r) for(int i=l;i<r;i++) if(i==l) cout<<a[i];else cout<<" "<<a[i];cout<<endl;
16 #define doutput(a,i,l,r) for(int i=r-1;i>=0;i--) if(i==r-1) cout<<a[i];else cout<<" "<<a[i];cout<<endl;
17 const long long N=500+10;
18 using namespace std;
19 int n;
20 int pic[1000][1000];
21 pair<int,int>s[N];
22 int main() {
23     while(cin>>n){
24         long long ct=0;
25         mem(pic,0);
26         for(int i=0;i<n;i++){
27             cin>>s[i].first>>s[i].second;
28             pic[s[i].first+300][s[i].second+300]=1;
29         }
30         for(int i=0;i<n;i++)
31             for(int j=0;j<n;j++){
32                 if(i==j) continue;
33                 pair<int,int>t1,t2;
34                 int f1=1,f2=1;
35                 t1.first=s[i].second-s[j].second+s[i].first;
36                 t1.second=s[j].first-s[i].first+s[i].second;
37                 if(pic[t1.first+300][t1.second+300]==0) f1=0;
38                 t2.first=s[i].second-s[j].second+s[j].first;
39                 t2.second=s[j].first-s[i].first+s[j].second;
40                 if(pic[t2.first+300][t2.second+300]==0) f2=0;
41                 if(f1&&f2) {
42                     ct++;
43                 }
44             }
45         cout<<ct/4<<endl;
46     }
47     return 0;
48 }