Buggy python submission (verdict: Time Limit Exceeded):
H, W = map(int, input().split())
A = [[1 if a == "#" else 0 for a in input()] for _ in range(H)]
X = [[[-2] * (H + 2) for _ in range(W + 2)] for _ in range(H + 2)]
Y = [[[-2] * (W + 2) for _ in range(W + 2)] for _ in range(H + 2)]

for i in range(H):
    for j in range(W):
        X[i][j][i] = j
        Y[i][j][j] = i
for i in range(H):
    for j in range(W-1)[::-1]:
        if A[i][j] == A[i][j+1]:
            X[i][j][i] = X[i][j+1][i]
for i in range(H-1)[::-1]:
    for j in range(W):
        if A[i][j] == A[i+1][j]:
            Y[i][j][j] = Y[i+1][j][j]

for i in range(H):
    for j in range(W):
        for ii in range(i+1, H):
            if A[ii][j] != A[i][j]:
                break
            X[i][j][ii] = min(X[i][j][ii-1], X[ii][j][ii])
for i in range(H):
    for j in range(W):
        for jj in range(j+1, W):
            if A[i][jj] != A[i][j]:
                break
            Y[i][j][jj] = min(Y[i][j][jj-1], Y[i][jj][jj])

for k in range(16):
    if X[0][0][H-1] == W-1:
        print(k)
        break
    elif k == 15:
        print(16)
        break
    for i in range(H):
        for j in range(W):
            for ii in range(i, H):
                if X[i][j][ii] >= 0 and X[i][X[i][j][ii] + 1][ii] >= 0:
                    X[i][j][ii] = X[i][X[i][j][ii] + 1][ii]
            for jj in range(j, W):
                if Y[i][j][jj] >= 0 and Y[Y[i][j][jj] + 1][j][jj] >= 0:
                    Y[i][j][jj] = Y[Y[i][j][jj] + 1][j][jj]
            
            jj = W - 1
            for ii in range(i, H):
                while jj >= j and Y[i][j][jj] < ii:
                    jj -= 1
                if jj >= j:
                    X[i][j][ii] = max(X[i][j][ii], jj)
            
            ii = H - 1
            for jj in range(j, W):
                while ii >= i and X[i][j][ii] < jj:
                    ii -= 1
                if ii >= i:
                    Y[i][j][jj] = max(Y[i][j][jj], ii)

Fixed submission:
H, W = map(int, input().split())
A = [[1 if a == "#" else 0 for a in input()] for _ in range(H)]
X = [[[-2] * (H + 2) for _ in range(W + 2)] for _ in range(H + 2)]
Y = [[[-2] * (W + 2) for _ in range(W + 2)] for _ in range(H + 2)]

for i in range(H):
    for j in range(W):
        X[i][j][i] = j
        Y[i][j][j] = i
for i in range(H):
    for j in range(W-1)[::-1]:
        if A[i][j] == A[i][j+1]:
            X[i][j][i] = X[i][j+1][i]
for i in range(H-1)[::-1]:
    for j in range(W):
        if A[i][j] == A[i+1][j]:
            Y[i][j][j] = Y[i+1][j][j]

for i in range(H):
    for j in range(W):
        for ii in range(i+1, H):
            if A[ii][j] != A[i][j]:
                break
            X[i][j][ii] = min(X[i][j][ii-1], X[ii][j][ii])
for i in range(H):
    for j in range(W):
        for jj in range(j+1, W):
            if A[i][jj] != A[i][j]:
                break
            Y[i][j][jj] = min(Y[i][j][jj-1], Y[i][jj][jj])

for k in range(16):
    if X[0][0][H-1] == W-1:
        print(k)
        break
    elif k == 15:
        print(16)
        break
    for i in range(H):
        Xi = X[i]
        Yi = Y[i]
        for j in range(W):
            Xij = Xi[j]
            Yij = Yi[j]
            for ii in range(i, H):
                Xijii = Xij[ii]
                if Xijii >= 0 and X[i][Xijii + 1][ii] >= 0:
                    Xij[ii] = X[i][Xijii + 1][ii]
            for jj in range(j, W):
                Yijjj = Yij[jj]
                if Yijjj >= 0 and Y[Yijjj + 1][j][jj] >= 0:
                    Yij[jj] = Y[Yijjj + 1][j][jj]
            
            jj = W - 1
            for ii in range(i, H):
                while jj >= j and Yij[jj] < ii:
                    jj -= 1
                if jj >= j:
                    Xij[ii] = max(Xij[ii], jj)
            
            ii = H - 1
            for jj in range(j, W):
                while ii >= i and Xij[ii] < jj:
                    ii -= 1
                if ii >= i:
                    Yij[jj] = max(Yij[jj], ii)

Buggy python submission (verdict: Time Limit Exceeded):
H, W = map(int, input().split())
A = [[1 if a == "#" else 0 for a in input()] for _ in range(H)]
X = [[[-2] * (H + 2) for _ in range(W + 2)] for _ in range(H + 2)]
Y = [[[-2] * (W + 2) for _ in range(W + 2)] for _ in range(H + 2)]

for i in range(H):
    for j in range(W):
        X[i][j][i] = j
        Y[i][j][j] = i
for i in range(H):
    for j in range(W-1)[::-1]:
        if A[i][j] == A[i][j+1]:
            X[i][j][i] = X[i][j+1][i]
for i in range(H-1)[::-1]:
    for j in range(W):
        if A[i][j] == A[i+1][j]:
            Y[i][j][j] = Y[i+1][j][j]

for i in range(H):
    for j in range(W):
        for ii in range(i+1, H):
            if A[ii][j] != A[i][j]:
                break
            X[i][j][ii] = min(X[i][j][ii-1], X[ii][j][ii])
for i in range(H):
    for j in range(W):
        for jj in range(j+1, W):
            if A[i][jj] != A[i][j]:
                break
            Y[i][j][jj] = min(Y[i][j][jj-1], Y[i][jj][jj])

for k in range(17):
    if X[0][0][H-1] == W-1:
        print(k)
        exit()
    for i in range(H):
        for j in range(W):
            for ii in range(i, H):
                if X[i][j][ii] >= 0 and X[i][X[i][j][ii] + 1][ii] >= 0:
                    X[i][j][ii] = X[i][X[i][j][ii] + 1][ii]
            for jj in range(j, W):
                if Y[i][j][jj] >= 0 and Y[Y[i][j][jj] + 1][j][jj] >= 0:
                    Y[i][j][jj] = Y[Y[i][j][jj] + 1][j][jj]
            
            jj = W - 1
            for ii in range(i, H):
                while jj >= j and Y[i][j][jj] < ii:
                    jj -= 1
                if jj >= j:
                    X[i][j][ii] = max(X[i][j][ii], jj)
            
            ii = H - 1
            for jj in range(j, W):
                while ii >= i and X[i][j][ii] < jj:
                    ii -= 1
                if ii >= i:
                    Y[i][j][jj] = max(Y[i][j][jj], ii)

Fixed submission:
H, W = map(int, input().split())
A = [[1 if a == "#" else 0 for a in input()] for _ in range(H)]
X = [[[-2] * (H + 2) for _ in range(W + 2)] for _ in range(H + 2)]
Y = [[[-2] * (W + 2) for _ in range(W + 2)] for _ in range(H + 2)]

for i in range(H):
    for j in range(W):
        X[i][j][i] = j
        Y[i][j][j] = i
for i in range(H):
    for j in range(W-1)[::-1]:
        if A[i][j] == A[i][j+1]:
            X[i][j][i] = X[i][j+1][i]
for i in range(H-1)[::-1]:
    for j in range(W):
        if A[i][j] == A[i+1][j]:
            Y[i][j][j] = Y[i+1][j][j]

for i in range(H):
    for j in range(W):
        for ii in range(i+1, H):
            if A[ii][j] != A[i][j]:
                break
            X[i][j][ii] = min(X[i][j][ii-1], X[ii][j][ii])
for i in range(H):
    for j in range(W):
        for jj in range(j+1, W):
            if A[i][jj] != A[i][j]:
                break
            Y[i][j][jj] = min(Y[i][j][jj-1], Y[i][jj][jj])

for k in range(16):
    if X[0][0][H-1] == W-1:
        print(k)
        break
    elif k == 15:
        print(16)
        break
    for i in range(H):
        Xi = X[i]
        Yi = Y[i]
        for j in range(W):
            Xij = Xi[j]
            Yij = Yi[j]
            for ii in range(i, H):
                Xijii = Xij[ii]
                if Xijii >= 0 and X[i][Xijii + 1][ii] >= 0:
                    Xij[ii] = X[i][Xijii + 1][ii]
            for jj in range(j, W):
                Yijjj = Yij[jj]
                if Yijjj >= 0 and Y[Yijjj + 1][j][jj] >= 0:
                    Yij[jj] = Y[Yijjj + 1][j][jj]
            
            jj = W - 1
            for ii in range(i, H):
                while jj >= j and Yij[jj] < ii:
                    jj -= 1
                if jj >= j:
                    Xij[ii] = max(Xij[ii], jj)
            
            ii = H - 1
            for jj in range(j, W):
                while ii >= i and Xij[ii] < jj:
                    ii -= 1
                if ii >= i:
                    Yij[jj] = max(Yij[jj], ii)

Buggy python submission (verdict: Time Limit Exceeded):
H, W = map(int, input().split())
A = [[1 if a == "#" else 0 for a in input()] for _ in range(H)]
X = [[[-2] * (H + 2) for _ in range(W + 2)] for _ in range(H + 2)]
Y = [[[-2] * (W + 2) for _ in range(W + 2)] for _ in range(H + 2)]

for i in range(H):
    for j in range(W):
        X[i][j][i] = j
        Y[i][j][j] = i
for i in range(H):
    for j in range(W-1)[::-1]:
        if A[i][j] == A[i][j+1]:
            X[i][j][i] = X[i][j+1][i]
for i in range(H-1)[::-1]:
    for j in range(W):
        if A[i][j] == A[i+1][j]:
            Y[i][j][j] = Y[i+1][j][j]

for i in range(H):
    for j in range(W):
        for ii in range(i+1, H):
            if A[ii][j] != A[i][j]:
                break
            X[i][j][ii] = min(X[i][j][ii-1], X[ii][j][ii])
for i in range(H):
    for j in range(W):
        for jj in range(j+1, W):
            if A[i][jj] != A[i][j]:
                break
            Y[i][j][jj] = min(Y[i][j][jj-1], Y[i][jj][jj])

for k in range(17):
    if X[0][0][H-1] == W-1:
        print(k)
        exit()
    for i in range(H):
        for j in range(W):
            for ii in range(i, H):
                if X[i][j][ii] >= 0 and X[i][X[i][j][ii] + 1][ii] >= 0:
                    X[i][j][ii] = X[i][X[i][j][ii] + 1][ii]
            for jj in range(j, W):
                if Y[i][j][jj] >= 0 and Y[Y[i][j][jj] + 1][j][jj] >= 0:
                    Y[i][j][jj] = Y[Y[i][j][jj] + 1][j][jj]
            
            jj = W - 1
            for ii in range(i, H):
                while jj >= j and Y[i][j][jj] < ii:
                    jj -= 1
                if jj >= j:
                    X[i][j][ii] = max(X[i][j][ii], jj)
            
            ii = H - 1
            for jj in range(j, W):
                while ii >= i and X[i][j][ii] < jj:
                    ii -= 1
                if ii >= i:
                    Y[i][j][jj] = max(Y[i][j][jj], ii)

Fixed submission:
H, W = map(int, input().split())
A = [[1 if a == "#" else 0 for a in input()] for _ in range(H)]
X = [[[-2] * (H + 2) for _ in range(W + 2)] for _ in range(H + 2)]
Y = [[[-2] * (W + 2) for _ in range(W + 2)] for _ in range(H + 2)]

for i in range(H):
    for j in range(W):
        X[i][j][i] = j
        Y[i][j][j] = i
for i in range(H):
    for j in range(W-1)[::-1]:
        if A[i][j] == A[i][j+1]:
            X[i][j][i] = X[i][j+1][i]
for i in range(H-1)[::-1]:
    for j in range(W):
        if A[i][j] == A[i+1][j]:
            Y[i][j][j] = Y[i+1][j][j]

for i in range(H):
    for j in range(W):
        for ii in range(i+1, H):
            if A[ii][j] != A[i][j]:
                break
            X[i][j][ii] = min(X[i][j][ii-1], X[ii][j][ii])
for i in range(H):
    for j in range(W):
        for jj in range(j+1, W):
            if A[i][jj] != A[i][j]:
                break
            Y[i][j][jj] = min(Y[i][j][jj-1], Y[i][jj][jj])

for k in range(16):
    if X[0][0][H-1] == W-1:
        print(k)
        break
    elif k == 15:
        print(16)
        break
    for i in range(H):
        Xi = X[i]
        Yi = Y[i]
        for j in range(W):
            Xij = Xi[j]
            Yij = Yi[j]
            for ii in range(i, H):
                Xijii = Xij[ii]
                if Xijii >= 0 and X[i][Xijii + 1][ii] >= 0:
                    Xij[ii] = X[i][Xijii + 1][ii]
            for jj in range(j, W):
                Yijjj = Yij[jj]
                if Yijjj >= 0 and Y[Yijjj + 1][j][jj] >= 0:
                    Yij[jj] = Y[Yijjj + 1][j][jj]
            
            jj = W - 1
            for ii in range(i, H):
                while jj >= j and Yij[jj] < ii:
                    jj -= 1
                if jj >= j:
                    Xij[ii] = max(Xij[ii], jj)
            
            ii = H - 1
            for jj in range(j, W):
                while ii >= i and Xij[ii] < jj:
                    ii -= 1
                if ii >= i:
                    Yij[jj] = max(Yij[jj], ii)

Buggy python submission (verdict: Time Limit Exceeded):
H, W = map(int, input().split())
A = [[0] * (W + 1)] + [[0] + [0 if a == "." else 1 for a in input()] for _ in range(H)]
for i in range(H):
    for j in range(W+1):
        A[i+1][j] += A[i][j]
for i in range(H+1):
    for j in range(W):
        A[i][j+1] += A[i][j]
D = {}

def calc(i1, i2, j1, j2):
    d = (i1 << 24) ^ (i2 << 16) ^ (j1 << 8) ^ (j2)
    if d in D:
        return D[d]
    
    s = A[i2][j2] - A[i2][j1] - A[i1][j2] + A[i1][j1]
    if s == 0 or s == (i2 - i1) * (j2 - j1):
        D[d] = 0
        return 0
    re = 100
    if j2 - j1 > 1:
        l = j1
        r = j2
        while r - l > 1:
            m = (l + r) // 2
            c1 = calc(i1, i2, j1, m)
            c2 = calc(i1, i2, m, j2)
            re = min(re, max(c1, c2) + 1)
            if c1 == c2:
                break
            if c1 < c2:
                l = m
            else:
                r = m
    if i2 - i1 > 1:
        l = i1
        r = i2
        while r - l > 1:
            m = (l + r) // 2
            c1 = calc(i1, m, j1, j2)
            c2 = calc(m, i2, j1, j2)
            re = min(re, max(c1, c2) + 1)
            if c1 == c2:
                break
            if c1 < c2:
                l = m
            else:
                r = m
    D[d] = re
    return re

print(calc(0, H, 0, W))

Fixed submission:
H, W = map(int, input().split())
A = [[1 if a == "#" else 0 for a in input()] for _ in range(H)]
X = [[[-2] * (H + 2) for _ in range(W + 2)] for _ in range(H + 2)]
Y = [[[-2] * (W + 2) for _ in range(W + 2)] for _ in range(H + 2)]

for i in range(H):
    for j in range(W):
        X[i][j][i] = j
        Y[i][j][j] = i
for i in range(H):
    for j in range(W-1)[::-1]:
        if A[i][j] == A[i][j+1]:
            X[i][j][i] = X[i][j+1][i]
for i in range(H-1)[::-1]:
    for j in range(W):
        if A[i][j] == A[i+1][j]:
            Y[i][j][j] = Y[i+1][j][j]

for i in range(H):
    for j in range(W):
        for ii in range(i+1, H):
            if A[ii][j] != A[i][j]:
                break
            X[i][j][ii] = min(X[i][j][ii-1], X[ii][j][ii])
for i in range(H):
    for j in range(W):
        for jj in range(j+1, W):
            if A[i][jj] != A[i][j]:
                break
            Y[i][j][jj] = min(Y[i][j][jj-1], Y[i][jj][jj])

for k in range(16):
    if X[0][0][H-1] == W-1:
        print(k)
        break
    elif k == 15:
        print(16)
        break
    for i in range(H):
        Xi = X[i]
        Yi = Y[i]
        for j in range(W):
            Xij = Xi[j]
            Yij = Yi[j]
            for ii in range(i, H):
                Xijii = Xij[ii]
                if Xijii >= 0 and X[i][Xijii + 1][ii] >= 0:
                    Xij[ii] = X[i][Xijii + 1][ii]
            for jj in range(j, W):
                Yijjj = Yij[jj]
                if Yijjj >= 0 and Y[Yijjj + 1][j][jj] >= 0:
                    Yij[jj] = Y[Yijjj + 1][j][jj]
            
            jj = W - 1
            for ii in range(i, H):
                while jj >= j and Yij[jj] < ii:
                    jj -= 1
                if jj >= j:
                    Xij[ii] = max(Xij[ii], jj)
            
            ii = H - 1
            for jj in range(j, W):
                while ii >= i and Xij[ii] < jj:
                    ii -= 1
                if ii >= i:
                    Yij[jj] = max(Yij[jj], ii)

Buggy python submission (verdict: Time Limit Exceeded):
H, W = map(int, input().split())
A = [[0] * (W + 1)] + [[0] + [0 if a == "." else 1 for a in input()] for _ in range(H)]
for i in range(H):
    for j in range(W+1):
        A[i+1][j] += A[i][j]
for i in range(H+1):
    for j in range(W):
        A[i][j+1] += A[i][j]
D = {}

def calc(i1, i2, j1, j2):
    d = (i1 << 24) ^ (i2 << 16) ^ (j1 << 8) ^ (j2)
    if d in D:
        return D[d]
    
    s = A[i2][j2] - A[i2][j1] - A[i1][j2] + A[i1][j1]
    if s == 0 or s == (i2 - i1) * (j2 - j1):
        D[d] = 0
        return 0
    re = 100
    if j2 - j1 > 1:
        l = j1
        r = j2
        while r - l > 1:
            m = (l + r) // 2
            c1 = calc(i1, i2, j1, m)
            c2 = calc(i1, i2, m, j2)
            re = min(re, max(c1, c2) + 1)
            if c1 == c2:
                break
            if c1 < c2:
                l = m
            else:
                r = m
    if i2 - i1 > 1:
        l = i1
        r = i2
        while r - l > 1:
            m = (l + r) // 2
            c1 = calc(i1, m, j1, j2)
            c2 = calc(m, i2, j1, j2)
            re = min(re, max(c1, c2) + 1)
            if c1 == c2:
                break
            if c1 < c2:
                l = m
            else:
                r = m
    D[d] = re
    return re

print(calc(0, H, 0, W))

Fixed submission:
H, W = map(int, input().split())
A = [[1 if a == "#" else 0 for a in input()] for _ in range(H)]
X = [[[-2] * (H + 2) for _ in range(W + 2)] for _ in range(H + 2)]
Y = [[[-2] * (W + 2) for _ in range(W + 2)] for _ in range(H + 2)]

for i in range(H):
    for j in range(W):
        X[i][j][i] = j
        Y[i][j][j] = i
for i in range(H):
    for j in range(W-1)[::-1]:
        if A[i][j] == A[i][j+1]:
            X[i][j][i] = X[i][j+1][i]
for i in range(H-1)[::-1]:
    for j in range(W):
        if A[i][j] == A[i+1][j]:
            Y[i][j][j] = Y[i+1][j][j]

for i in range(H):
    for j in range(W):
        for ii in range(i+1, H):
            if A[ii][j] != A[i][j]:
                break
            X[i][j][ii] = min(X[i][j][ii-1], X[ii][j][ii])
for i in range(H):
    for j in range(W):
        for jj in range(j+1, W):
            if A[i][jj] != A[i][j]:
                break
            Y[i][j][jj] = min(Y[i][j][jj-1], Y[i][jj][jj])

for k in range(16):
    if X[0][0][H-1] == W-1:
        print(k)
        break
    elif k == 15:
        print(16)
        break
    for i in range(H):
        Xi = X[i]
        Yi = Y[i]
        for j in range(W):
            Xij = Xi[j]
            Yij = Yi[j]
            for ii in range(i, H):
                Xijii = Xij[ii]
                if Xijii >= 0 and X[i][Xijii + 1][ii] >= 0:
                    Xij[ii] = X[i][Xijii + 1][ii]
            for jj in range(j, W):
                Yijjj = Yij[jj]
                if Yijjj >= 0 and Y[Yijjj + 1][j][jj] >= 0:
                    Yij[jj] = Y[Yijjj + 1][j][jj]
            
            jj = W - 1
            for ii in range(i, H):
                while jj >= j and Yij[jj] < ii:
                    jj -= 1
                if jj >= j:
                    Xij[ii] = max(Xij[ii], jj)
            
            ii = H - 1
            for jj in range(j, W):
                while ii >= i and Xij[ii] < jj:
                    ii -= 1
                if ii >= i:
                    Yij[jj] = max(Yij[jj], ii)

Buggy python submission (verdict: Time Limit Exceeded):
H, W = map(int, input().split())
A = [[0] * (W + 1)] + [[0] + [0 if a == "." else 1 for a in input()] for _ in range(H)]
for i in range(H):
    for j in range(W+1):
        A[i+1][j] += A[i][j]
for i in range(H+1):
    for j in range(W):
        A[i][j+1] += A[i][j]

def calc(i1, i2, j1, j2):
    s = A[i2][j2] - A[i2][j1] - A[i1][j2] + A[i1][j1]
    if s == 0 or s == (i2 - i1) * (j2 - j1):
        return 0
    re = 100
    if j2 - j1 > 1:
        l = j1
        r = j2
        while r - l > 1:
            m = (l + r) // 2
            c1 = calc(i1, i2, j1, m)
            c2 = calc(i1, i2, m, j2)
            re = min(re, max(c1, c2) + 1)
            if c1 == c2:
                break
            if c1 < c2:
                l = m
            else:
                r = m
    if i2 - i1 > 1:
        l = i1
        r = i2
        while r - l > 1:
            m = (l + r) // 2
            c1 = calc(i1, m, j1, j2)
            c2 = calc(m, i2, j1, j2)
            re = min(re, max(c1, c2) + 1)
            if c1 == c2:
                break
            if c1 < c2:
                l = m
            else:
                r = m
    return re

print(calc(0, H, 0, W))

Fixed submission:
H, W = map(int, input().split())
A = [[1 if a == "#" else 0 for a in input()] for _ in range(H)]
X = [[[-2] * (H + 2) for _ in range(W + 2)] for _ in range(H + 2)]
Y = [[[-2] * (W + 2) for _ in range(W + 2)] for _ in range(H + 2)]

for i in range(H):
    for j in range(W):
        X[i][j][i] = j
        Y[i][j][j] = i
for i in range(H):
    for j in range(W-1)[::-1]:
        if A[i][j] == A[i][j+1]:
            X[i][j][i] = X[i][j+1][i]
for i in range(H-1)[::-1]:
    for j in range(W):
        if A[i][j] == A[i+1][j]:
            Y[i][j][j] = Y[i+1][j][j]

for i in range(H):
    for j in range(W):
        for ii in range(i+1, H):
            if A[ii][j] != A[i][j]:
                break
            X[i][j][ii] = min(X[i][j][ii-1], X[ii][j][ii])
for i in range(H):
    for j in range(W):
        for jj in range(j+1, W):
            if A[i][jj] != A[i][j]:
                break
            Y[i][j][jj] = min(Y[i][j][jj-1], Y[i][jj][jj])

for k in range(16):
    if X[0][0][H-1] == W-1:
        print(k)
        break
    elif k == 15:
        print(16)
        break
    for i in range(H):
        Xi = X[i]
        Yi = Y[i]
        for j in range(W):
            Xij = Xi[j]
            Yij = Yi[j]
            for ii in range(i, H):
                Xijii = Xij[ii]
                if Xijii >= 0 and X[i][Xijii + 1][ii] >= 0:
                    Xij[ii] = X[i][Xijii + 1][ii]
            for jj in range(j, W):
                Yijjj = Yij[jj]
                if Yijjj >= 0 and Y[Yijjj + 1][j][jj] >= 0:
                    Yij[jj] = Y[Yijjj + 1][j][jj]
            
            jj = W - 1
            for ii in range(i, H):
                while jj >= j and Yij[jj] < ii:
                    jj -= 1
                if jj >= j:
                    Xij[ii] = max(Xij[ii], jj)
            
            ii = H - 1
            for jj in range(j, W):
                while ii >= i and Xij[ii] < jj:
                    ii -= 1
                if ii >= i:
                    Yij[jj] = max(Yij[jj], ii)