for y in range(-1,2):
if(trap[m+y][n+x] == 1):
count +=1
if(count >=2):
trapTri[m-1][n] = count
#Sum of triples
result =0
for n in range(1,i+1):
if(trap[2][n] == 1):
count = 0
for x in range(-1,2):
for y in range(-1,2):
if(trapTri[1+y][n+x] > 1):
count +=1
if(count > 0):
result += (i-1)*(i)/2+n
return result
def solve():
return str(solveRow(5678027) + solveRow(7208785))
#Test cases for verification
Util_PESupport.testCase(solveRow,8, 60)
Util_PESupport.testCase(solveRow,9, 37)
Util_PESupport.testCase(solveRow,10000, 950007619)
#Final Execution
Util_PESupport.timedSolution(solve)
