#include <iostream>
#include <stdio.h>
#include<memory.h>
using namespace std;const int N = 8;
#define null NULL
struct Node
{char a[8];int al;Node* cp[8];int cl;Node(){memset(a, 0, sizeof(a));al = 0;memset(cp, 0, sizeof(cp));cl = 0;};
};
char le[] = { 'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h' };
const int l = 8;
Node* root = null;void copy(Node* root, Node* node, int index, char c)
{int k = root->al + 1;int j = 0;for (int i = 0; i < k; i++){if (i == index){node->a[node->al++] = c;continue;}node->a[node->al++] = root->a[j++];}
}void buildTree(Node* root, int index, int n)
{if (index == n) return;for (int i = index; i >= 0; i--){Node* node = new Node();copy(root, node, i, le[index]);root->cp[root->cl++] = node;}for (int i = 0; i < root->cl; i++)buildTree(root->cp[i], index + 1, n);
}
void blank(int n)
{for (int i = 0; i < n; i++)cout << " ";
}
void print(char a[], int l)
{cout << a[0];for (int i = 1; i < l; i++)cout << "," << a[i];}
void dfs(Node* root, int n, int index, int bs)
{if (index + 1 == n){blank(bs);cout << "writeln(";print(root->a, root->al);cout << ")" << endl;return;}for (int i = 0; i < root->cl; i++){blank(bs);if (i == 0){cout << "if ";}else if (i == root->cl - 1){cout << "else ";}else{cout << "else if ";}if (i == 0){cout << root->cp[i]->a[index] << " < " << root->cp[i]->a[index + 1]<< " " << "then";}else if (i != root->cl - 1){cout << root->cp[i]->a[index - i] << " < "<< root->cp[i]->a[index + 1 - i] << " " << "then";}cout << endl;dfs(root->cp[i], n, index + 1, bs + 2);}
}int main()
{freopen("C:\\Users\\zzzzz\\Desktop\\1.txt", "r", stdin);int caseNum = 0;cin >> caseNum;while (caseNum--){int m;cin >> m;cout << "program sort(input,output);" << endl;cout << "var" << endl;print(le, m);cout << " : " << "integer;" << endl;cout << "begin" << endl;int bs = 2;blank(bs);cout << "readln(";print(le, m);cout << ");" << endl;int index = 0;root = new Node();root->a[root->al++] = le[index];index++;buildTree(root, index, m);//cout << root->cl << endl;if (m == 1){blank(bs);cout << "writeln(a)" << endl;}else{dfs(root, m, 0, bs);}cout << "end." << endl;if (caseNum != 0){cout << endl;}}return 0;
}