#include <stdio.h>
#include <stdlib.h>
int display();
int create(int value);

typedef struct node
{
    int data;
    struct node *next;
     struct node *pre;
    
}node;
node *tail,*head,*newnode;
int main() {
    int n;
    scanf("%d",&n);
    
   int arr[n];
   int value;
   for(int i=0;i<n;i++)
   {
     scanf("%d",&value);      
   create(value);
       
   }
   int key;
   scanf("%d",&key);
   display( key);
   
}
int create(int value)
{
    newnode=(node*)malloc(sizeof(node));
    newnode->next=NULL;
     newnode->pre=NULL;
    newnode->data=value;
    if(head==NULL){
        head=newnode;
        tail=newnode;
       
    }
    else
    {   newnode->pre=tail;
        tail->next=newnode;
        tail=newnode;
       
        
    }
    head->pre=tail;
    tail->next=head;
}
int display(int key)
{
    node* ind,*itr;
    ind=head;
   
   if(key>0)
   {
    do
    {   int sum=0,i;
    for(itr=ind->next;i=1;i<=key;itr=itr->next,i++)
    {
        sum+=itr->data;
    }
        printf("%d ",sum);
       ind=ind->next;
    }while(tem!=head);
   }
  
   
   
}