fjnu 1945 Hello Kitty

Description

Kitty sends a kind of original email messages to her friend Garf. To write a message, she chooses a word W and a number n and replicates W n times horizontally. Then she repeats this string in the next line, but rotating the characters once to the left. And she repeats this 'rotate-and-output' process until the word W appears displayed as the first column of the rectangular pattern that she produces.

As an example, when she chooses the word Hello and the number 3, she gets the pattern:

HelloHelloHello
elloHelloHelloH
lloHelloHelloHe
loHelloHelloHel
oHelloHelloHell

Kitty has been sending such emails during the last three years. Recently, Garf told her that perhaps her work may be automatized with a software to produce Kitty's patterns. Could you help her?

Input

The input contains several test cases, each one of them in a separate line. Each test case has a word and a positive integer that should generate the corresponding rectangular pattern. The word is a string of alphabetic characters (a..z). The number is less than 10.

A line whose contents is a single period character means the end of the input (this last line is not to be processed).

Output

Output texts for each input case are presented in the same order that input is read. For each test case the answer must be a left aligned Kitty pattern corresponding to the input.

Sample Input

Love 1Kitty 2.

 

Sample Output

LoveoveLveLoeLovKittyKittyittyKittyKttyKittyKityKittyKityKittyKitt

 

KEY:先将字符串复制n次；然后每打印一次后移动；打印次数就是字符数；

 

Source:

#include<iostream>
#include<cstring>
using namespace std;

char str[1000];
int L;
char s[100];
int len;
int n;

void move()
...{
    char t;
    t=str[0];
    int i;
    for(i=0;i<L-1;i++)
        str[i]=str[i+1];
    str[i]=t;
}

void fun()
...{
    int i;
    for(i=1;i<=len;i++)
    ...{
        cout<<str<<endl;
        move();
    }
}

void init()
...{
    strcpy(str,"