n = int(input())
s = int(input())
d = [[0] * n for i in range(n)]
for i in range(n):
    d[i] = list(map(int, input().split()))
sm = [[0] * (n + 1) for i in range(n + 1)]
sm[1][1] = d[0][0]
for i in range(2, n + 1):
    sm[i][0] = sm[i - 1][0] + d[i - 1][0]
for i in range(2, n + 1):
    sm[0][i] = sm[0][i - 1] + d[0][i - 1]
for i in range(1, n):
    for j in range(1, n):
        sm[i][j] = sm[i - 1][j] + sm[i][j - 1] - sm[i - 1][j - 1] + d[i][j]
cnt = 0
print(sm)
for i in range(1, n + 1):
    for j in range(1, n + 1):
        for k in range(1, max(i, j) + 1):
            if sm[i][j] - sm[i - k][j] - sm[i][j - k] + sm[i - k][j - k] >= s:
                print(i, j, k)
                cnt += 1
print(cnt)