#include <bits/stdc++.h>
#include <time.h>
using namespace std;
#define int long long
#define CIN(x) for(auto &i : x) \
cin>>i;
#define deb(x) cout<<#x <<' '<<x<<nl;
#define ios ios::sync_with_stdio(0); \
cin.tie(0);\
void read(){
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
}
//////////////////////////////////////////////////
const int INF = INT_MAX;
void solve(){
int n , k; cin>>n>>k;
vector<char>arr(26);
for(int i = 0 ; i < 26 ; ++i)
arr[i] = i + 'a';
string s = "";
for(int i = 0 ; i < n ; ++i)
cout<<arr[i % k];
cout<<'\n';
}
signed main(){ ios
// read();
int tt = 1;
cin>>tt;
for(int t = 1 ; t <= tt ; ++t){
solve();
}
return 0;
}
380. Insert Delete GetRandom O(1) | 332. Reconstruct Itinerary |
368. Largest Divisible Subset | 377. Combination Sum IV |
322. Coin Change | 307. Range Sum Query - Mutable |
287. Find the Duplicate Number | 279. Perfect Squares |
275. H-Index II | 274. H-Index |
260. Single Number III | 240. Search a 2D Matrix II |
238. Product of Array Except Self | 229. Majority Element II |
222. Count Complete Tree Nodes | 215. Kth Largest Element in an Array |
198. House Robber | 153. Find Minimum in Rotated Sorted Array |
150. Evaluate Reverse Polish Notation | 144. Binary Tree Preorder Traversal |
137. Single Number II | 130. Surrounded Regions |
129. Sum Root to Leaf Numbers | 120. Triangle |
102. Binary Tree Level Order Traversal | 96. Unique Binary Search Trees |
75. Sort Colors | 74. Search a 2D Matrix |
71. Simplify Path | 62. Unique Paths |