/*
#include <stdio.h>
int main()
{
int a[100001]={},sum=0,N,K,i,j,max=-1000000;
scanf("%d %d",&N,&K);
for(i=1;i<=N;i++)
{
scanf("%d",&a[i]);
}
for(i=1;i<=N-K+1;i++)
{
sum=0;
for(j=i;j<i+K;j++)
{
sum+=a[j];
}
if(max<sum)
{
max=sum;
}
}
printf("%d",max);
return 0;
}
*/
/*
#include <stdio.h>
int a[10001];
int n, i, j, temp, key;
int main() {
scanf("%d", &n);
for (i = 1; i <= n; i++)
scanf("%d", &a[i]);
for (i=2; i<=n; i++)
{
key=a[i];
for(j=i-1;j>0&&a[j]>key;j--)
{
a[j+1]=a[j];
}
a[j+1]=key;
}
for (i=1; i<=n; i++)
printf("%d\n", a[i]);
return 0;
}
*/
/*
#include <stdio.h>
#define SIZE 100
int stack[SIZE];
int top=-1; //top은 데이터가 마지막으로 저장된 위치
void push(int data)
{
//top++;
stack[++top]=data;
}
int pop()
{
return stack[top--];
}
int main()
{
push(3);
printf("top = %d\n",top);
push(4);
printf("top = %d\n",top);
push(5);
printf("top = %d\n",top);
printf("pop data is = %d\n",pop());
printf("top = %d\n",top);
}
*/
/*
#include <stdio.h>
char stack[100];
int top=-1;
void push(char data)
{
top++;
stack[top]=data;
}
char pop()
{
return stack[top--];
}
int main()
{
int i;
char str[100]={};
scanf("%s",str);
for(i=0;i<strlen(str);i++)
{
push(str[i]);
}
for(i=0;i<strlen(str);i++)
{
printf("%c",pop());
}
return 0;
}
*/
/*
#include <stdio.h>
char stack[100];
int top=-1;
void push (char data)
{
top++;
stack[top]=data;
}
char pop()
{
return stack[top--];
}
int main()
{
int n,i;
char str[1000]={};
scanf ("%d ",&n);
scanf("%s",str);
for(i=n-1;i>=0;i--)
{
push(str[i]);
}
n=top;
for(i=n;i>=0;i--)
{
if(i%3==2 && i!=n) printf(",");
printf("%c",pop());
}
return 0;
}
*/