Codeforces Round #527 (Div. 3) A. Uniform String

A. Uniform String

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

You are given two integers nn and kk.

Your task is to construct such a string ss of length nn that for each ii from 11 to kk there is at least one ii-th letter of the Latin alphabet in this string (the first letter is 'a', the second is 'b' and so on) and there are no other letters except these. You have to maximize the minimal frequency of some letter (the frequency of a letter is the number of occurrences of this letter in a string). If there are several possible answers, you can print any.

You have to answer tt independent queries.

Input

The first line of the input contains one integer tt (1≤t≤1001≤t≤100) — the number of queries.

The next tt lines are contain queries, one per line. The ii-th line contains two integers nini and kiki (1≤ni≤100,1≤ki≤min(ni,26)1≤ni≤100,1≤ki≤min(ni,26)) — the length of the string in the ii-th query and the number of characters in the ii-th query.

Output

Print tt lines. In the ii-th line print the answer to the ii-th query: any string sisi satisfying the conditions in the problem statement with constraints from the ii-th query.

Example

input

Copy

3
7 3
4 4
6 2

output

Copy

cbcacab
abcd
baabab

Note

In the first example query the maximum possible minimal frequency is 22, it can be easily seen that the better answer doesn't exist. Other examples of correct answers: "cbcabba", "ccbbaaa" (any permutation of given answers is also correct).

In the second example query any permutation of first four letters is acceptable (the maximum minimal frequency is 11).

In the third example query any permutation of the given answer is acceptable (the maximum minimal frequency is 33).

题意：

用a b~z等小写字母构造一个字符串，你必须最大限度的提高一些 字母的最小频率。也就是将总的字母个数分n均分给k个字母（从a~z的小写字母），多余的任意分给其中一个就可以。

分析：通过对temp=n/k整除得到的结果，进行两重循环输出即可。特判一下多余的都输出a

代码：

#include<iostream>
using namespace std;
int main()
{
    int t;
    cin>>t;
   while(t--)
   {
    int n,k,s=0;
    cin>>n>>k;
    int temp=n/k;
    for(int i=1;i<=k;i++)
    {
        for(int j=1;j<=temp;j++)
        {
            cout<<char('a'+s);
        }
        s++;
    }
    int w=n-temp*k;
    if(w!=0)
    {
        for(int i=1;i<=w;i++)
        {
            cout<<"a";
        }
    }
     cout<<endl;
   }
    return 0;
}