#include<set>
#include<map>
#include<ctime>
#include<cmath>
#include<stack>
#include<queue>
#include<bitset>
#include<cstdio>
#include<string>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<functional>
#define rep(i,j,k) for (int i = j; i <= k; i++)
#define per(i,j,k) for (int i = j; i >= k; i--)
#define lson x << 1, l, mid
#define rson x << 1 | 1, mid + 1, r
using namespace std;
typedef long long LL;
const int low(int x) { return x&-x; }
const double eps = 1e-8;
const int INF = 0x7FFFFFFF;
const int mod = 1e9 + 7;
const int N = 2e5 + 10;
const int read()
{
char ch = getchar();
while (ch<'0' || ch>'9') ch = getchar();
int x = ch - '0';
while ((ch = getchar()) >= '0'&&ch <= '9') x = x * 10 + ch - '0';
return x;
}
int T, n, x, t = 0;
char s[2];
int main()
{
while (scanf("%s", s), s[0] != '@')
{
printf("%s", t++ ? "\n" : "");
scanf("%d", &n);
rep(i, 1, n - 1)
{
rep(j, 1, n - i) printf(" ");
printf("%c", s[0]);
rep(j, 1, 2 * i - 3) printf(" ");
if (i > 1) printf("%c", s[0]);
printf("\n");
}
rep(i, 1, 2 * n - 1) printf("%c", s[0]);
putchar(10);
}
return 0;
}