#include<bits/stdc++.h>
using namespace std;
#define ll long long int
int main(){
ll t;
cin>>t;
while(t--){
ll n,k,m;
cin>>n >>k >>m;
string s;
cin>>s;
set<char>s1;
ll count=0;
ll j=0;
string w="";
for(ll i=0;i<m;i++){
s1.insert(s[i]);
if(s1.size()==k){
count++;
s1.clear();
w+=s[i];
}
}
// cout<<s.size()<<endl;
if(count>=n){
cout<<"YES"<<endl;
}
else{
cout<<"NO"<<endl;
// we will constuct string of length n
cout<<w;
char c;
for(ll i=97;i<(97+k);i++){
bool ok=false;
if(s1.find((char)i)==s1.end()){
c=(char)i;
ok=true;
break;
}
if(ok){
break;
}
}
for(ll i=1;i<=(n-w.size());i++){
cout<<c;
}
cout<<endl;
}
}
}
50. Pow(x, n) | 43. Multiply Strings |
34. Find First and Last Position of Element in Sorted Array | 33. Search in Rotated Sorted Array |
17. Letter Combinations of a Phone Number | 5. Longest Palindromic Substring |
3. Longest Substring Without Repeating Characters | 1312. Minimum Insertion Steps to Make a String Palindrome |
1092. Shortest Common Supersequence | 1044. Longest Duplicate Substring |
1032. Stream of Characters | 987. Vertical Order Traversal of a Binary Tree |
952. Largest Component Size by Common Factor | 212. Word Search II |
174. Dungeon Game | 127. Word Ladder |
123. Best Time to Buy and Sell Stock III | 85. Maximal Rectangle |
84. Largest Rectangle in Histogram | 60. Permutation Sequence |
42. Trapping Rain Water | 32. Longest Valid Parentheses |
Cutting a material | Bubble Sort |
Number of triangles | AND path in a binary tree |
Factorial equations | Removal of vertices |
Happy segments | Cyclic shifts |