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

int solution(int* nums, int numsSize, int k) {
    int count = 0;
    int prefixSum = 0;
    
    // Simple array to count remainders (assuming k <= 1000)
    int remainderCount[1001] = {0};
    remainderCount[0] = 1; // Initialize with 0 to handle subarrays starting from index 0
    
    for (int i = 0; i < numsSize; i++) {
        prefixSum += nums[i];
        int remainder = prefixSum % k;
        
        // Handle negative remainders
        if (remainder < 0) {
            remainder += k;
        }
        
        // If we've seen this remainder before, we can form valid subarrays
        count += remainderCount[remainder];
        remainderCount[remainder]++;
    }
    
    return count;
}

int main() {
    char line[10000];
    fgets(line, sizeof(line), stdin);
    
    int nums[1000];
    int numsSize = 0;
    char* token = strtok(line + 1, ",]");
    while (token != NULL) {
        nums[numsSize++] = atoi(token);
        token = strtok(NULL, ",]");
    }
    
    int k;
    scanf("%d", &k);
    
    int result = solution(nums, numsSize, k);
    printf("%d\n", result);
    
    return 0;
}