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

int* solution(int* cost, int costSize, int* returnSize) {
    *returnSize = costSize;
    int* result = (int*)malloc(costSize * sizeof(int));
    
    // To reach position i, we need to pay everyone from i to n-1
    for (int i = 0; i < costSize; i++) {
        int totalCost = 0;
        for (int j = i; j < costSize; j++) {
            totalCost += cost[j];
        }
        result[i] = totalCost;
    }
    
    return result;
}

int main() {
    char line[1000];
    fgets(line, sizeof(line), stdin);
    
    // Parse array manually
    int cost[100];
    int costSize = 0;
    char* token = strtok(line, "[,]");
    while (token != NULL) {
        cost[costSize++] = atoi(token);
        token = strtok(NULL, "[,]");
    }
    
    int returnSize;
    int* result = solution(cost, costSize, &returnSize);
    
    printf("[");
    for (int i = 0; i < returnSize; i++) {
        printf("%d", result[i]);
        if (i < returnSize - 1) printf(",");
    }
    printf("]\n");
    
    free(result);
    return 0;
}