#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int k;
int len1, len2;
char st[20];
char leet[60];
int mp[120][2];
inline bool check(int *str, int pos){
int size = str[1]-str[0]+1;
if(pos+size > len2)
return false;
for(int i=str[0], j=0; i<=str[1]; ++i, ++j)
if(leet[i] != leet[pos+j])
return false;
return true;
}
bool dfs(int pos1, int pos2){
if(pos2>=len2 && pos1<len1 || pos1>=len1 && pos2<len2)
return false;
if(pos1>=len1 && pos2>=len2)
return true;
int ch = st[pos1];
if(mp[ch][0] == -1){
mp[ch][0] = pos2;
for(int i=1; i<=k && pos2+i<=len2; ++i) {
mp[ch][1] = pos2+i-1;
if(dfs(pos1+1, pos2+i)) return true;
}
mp[ch][0] = -1;
}else{
if(check(mp[ch], pos2) && dfs(pos1+1,pos2+mp[ch][1]-mp[ch][0]+1))
return true;
}
return false;
}
int main(){
int T;
scanf("%d", &T);
while(T--){
scanf("%d%s%s",&k, st, leet);
len1=strlen(st);
len2=strlen(leet);
memset(mp, -1, sizeof(mp));
if(dfs(0,0)) puts("1");
else puts("0");
}
return 0;
}