def workbook(n, k, arr):
    st, res = 0, 0
    for a in arr:
        q, r = divmod(a, k)
        for i in range(a):
            if i == i // k + st:
                res += 1
        st += q + int(r != 0)
    return res

int workbook(int n, int k, vector<int> arr) {
    
    unordered_map<int, pair<int,int>> m;
    int page = 1;
    
    for(int i=0; i<n; i++)
    {
        int prob = 1;
        
        while(prob <= arr[i])
        {
            m[page].first = prob;
            m[page].second = min(arr[i], prob + k - 1);
            prob = prob + k;
            page++;
        }
    }
    
    int count = 0;
    for(auto it : m)
    {
        if(it.first >= it.second.first && it.first <= it.second.second)
            count++;
    }
    
    return count;
}

def workbook(chapter_count, problems_per_page, chapters):

    if chapter_count == 0:
        return 0
    if problems_per_page == 0:
        return 0
    if len(chapters) == 0:
        return 0

    special_count = 0
    current_page = 0

    for chapter in chapters:
        #Each chapter starts on a new page
        current_page +=1
        for problem in range(1,chapter+1):
            if problem == current_page:
                special_count+=1
            # don't turn page if this is the last problem
            if problem != chapter and problem % problems_per_page == 0:
                current_page +=1

    return special_count

def workbook(n, k, arr):
    res=0
    x=[]
    for v in arr:
        d={}
        for i in range(v):
            if (i+1)%k!=0:
                d[i+1]=1
                
            else:
                d[i+1]=1
                x.append(d)
                d={}
        if v%k!=0:
            x.append(d)
    for i in range(len(x)):
        if i+1 in x[i]:
            res+=1
    return res

def workbook(n, k, arr):
    current_page=1
    special=0
    for chapter in range(1,n+1):
        nop=arr[chapter-1]
        counter=0
        for problem in range(1,nop+1):
            counter+=1
            if counter==k+1:
                current_page+=1
                counter=1
            if problem==current_page:
                special+=1
            print(chapter,problem,current_page,counter,special)
        current_page+=1
    return special