#include <stdio.h>
#include <stdlib.h>

typedef struct node{
    struct node *prev;
    int data;
    struct node *next;
}Node;

Node *head=NULL,*tail;

void create(int num){
    Node *newnode= (Node*)malloc(1 * sizeof(Node));
    newnode->data=num;
    newnode->prev=NULL;
    newnode->next=NULL;
    if(head==NULL){
        head=newnode;
        tail=newnode;
    }
    else{
        newnode->prev=tail;
        tail->next=newnode;
        tail=newnode;
    }
    head->prev=tail;
    tail->next=head;
}

void display(int key){
    Node *itr,*ind;
    int i;
    ind=head;
    if(key>0){
        do{
            int sum = 0;
            for(itr=ind->next;i=1,i<=key;itr=itr->next,i++){
                sum=sum+itr->data;
            }
            printf("%d ",sum);
            iter = iter->next;
        }while(iter!=head);
    }
    else{
        do{
            int sum = 0;
            for(itr=iter->prev;i=1,i<=key;itr=itr->prev,i++){
                sum=sum+itr->data;
            }
            printf("%d ",sum);
            iter = iter->next;
        }while(iter!=head);
    }
}

int main(){
    int N,in,num,key;
    scanf("%d",&N);
    for(in=0;in<N;in++){
        scanf("%d",&num);
        create(num);
    }
    scanf("%d",&key);
    display(key);
    return 0;
}