#include <vector>
using namespace std;
 
// Function to count subarrays having sum less than k
int countsubarray(vector<int> &arr, int k)
{
    int n = arr.size();
    int count = 0;
 
    // Pick starting point
    for (int i = 0; i < n; i++)
    {
        int sum = 0;
 
        // Pick ending point
        for (int j = i; j < n; j++)
        {
            // If sum is less than k, update sum and count
            if (sum + arr[j] < k)
            {
                sum += arr[j];
                count++;
            }
            else
            {
                break;
            }
        }
    }
 
    return count;
}
 
 

I2luY2x1ZGUgPHZlY3Rvcj4KdXNpbmcgbmFtZXNwYWNlIHN0ZDsKCi8vIEZ1bmN0aW9uIHRvIGNvdW50IHN1YmFycmF5cyBoYXZpbmcgc3VtIGxlc3MgdGhhbiBrCmludCBjb3VudHN1YmFycmF5KHZlY3RvcjxpbnQ+ICZhcnIsIGludCBrKQp7CiAgICBpbnQgbiA9IGFyci5zaXplKCk7CiAgICBpbnQgY291bnQgPSAwOwoKICAgIC8vIFBpY2sgc3RhcnRpbmcgcG9pbnQKICAgIGZvciAoaW50IGkgPSAwOyBpIDwgbjsgaSsrKQogICAgewogICAgICAgIGludCBzdW0gPSAwOwoKICAgICAgICAvLyBQaWNrIGVuZGluZyBwb2ludAogICAgICAgIGZvciAoaW50IGogPSBpOyBqIDwgbjsgaisrKQogICAgICAgIHsKICAgICAgICAgICAgLy8gSWYgc3VtIGlzIGxlc3MgdGhhbiBrLCB1cGRhdGUgc3VtIGFuZCBjb3VudAogICAgICAgICAgICBpZiAoc3VtICsgYXJyW2pdIDwgaykKICAgICAgICAgICAgewogICAgICAgICAgICAgICAgc3VtICs9IGFycltqXTsKICAgICAgICAgICAgICAgIGNvdW50Kys7CiAgICAgICAgICAgIH0KICAgICAgICAgICAgZWxzZQogICAgICAgICAgICB7CiAgICAgICAgICAgICAgICBicmVhazsKICAgICAgICAgICAgfQogICAgICAgIH0KICAgIH0KCiAgICByZXR1cm4gY291bnQ7Cn0KCg==