public static int workbook(int n, int k, List<Integer> arr) {
    // Write your code here
        int count=0;
        int pageNo=1;
        for(int i=0;i<arr.size();i++){
            for(int j=0;j<arr.get(i);j++){
                if(j+1==pageNo){
                    count++;
                }
                if((j+1)%k==0||j==arr.size()-1)
                pageNo++;
            }
        }
        return count;

    }

var page = 1;
var result = 0;
for (int i = 0; i < n; i++)
{
    var index = 1;
    while (index <= arr[i])
    {
        if (page == index)
            result++;
        if (index % k == 0 && index != arr[i])
            page++;
        index++;
    }
    page++;
}
return result;

int workbook(int n, int k, vector<int> arr) {
    int page = 1, chapter = 1, fe = 1, res = 0;
    while(chapter <= arr.size()){
        int le = min(fe + k - 1, arr[chapter-1]);
        if(fe <= page && page <= le) res++;
        fe = le + 1;
        if(fe > arr[chapter-1]) {
            chapter++;
            fe = 1;
        }
        page ++;
    }   
    return res;
}

int workbook(int n, int k, vector<int> arr) {
    int page = 0, special = 0;
    for (int i = 0; i < n; i++) {
        int cur = 0, prev = 0; //cur -> last problem in current page. prev -> last problem in previous page.
        while(arr[i] > 0) {
            prev = cur;
            if (arr[i] > k) 
                cur += k;  //if arr[i] > k  then k no: of problems are there in current page.
            else 
                cur += arr[i]; //else only arr[i] no:of problems are there in this page.
            page++; // no: of problems are calculated and page is incremented
            if (page <= cur && page > prev) 
                special++; //if page no: lies between previous page last problem(exclusive) and current page last problem(inclusive) it is a special problem.
            arr[i] -= k;
        }
    }
    return special;
}