Point in Polygon

import sys
import math
input = sys.stdin.readline
 
def gcd(a, b):
    while b != 0:
        a, b = b, a%b
    return a
 
class Point:
    def __init__(self, x, y):
        self.x = x
        self.y = y
 
    def __sub__(self, other):
        return Point(self.x - other.x, self.y - other.y)
 
    def __eq__(self, other):
        return self.x == other.x and self.y == other.y
 
 
class Line:
    def __init__(self, a, b):
        self.a = a
        self.b = b
 
 
def cross_product(p, q):
    #x1y2 − x2y1
    return p.x * q.y - p.y * q.x
 
 
def from_the_line(p, s):
    #(p−s1)×(p−s2)
    return cross_product(p - s.a, p - s.b)
 
 
def on_the_line(p, s):
    return (cross_product(p - s.a, p - s.b) == 0 and (min(s.a.y, s.b.y) <= p.y <= max(s.a.y, s.b.y)) and
            (min(s.a.x, s.b.x) <= p.x <= max(s.a.x, s.b.x)))
 
 
def same_line(p, q):
    return on_the_line(p.a, q) or on_the_line(p.b, q) or on_the_line(q.a, p) or on_the_line(q.b, p)
 
 
def end_intersection(p, q):
    return p.a == q.a or p.a == q.b or p.b == q.b or p.b == q.a
 
 
def middle_intersection(p, q):
    return ((from_the_line(p.a, q) * from_the_line(p.b, q)) < 0) and
            (from_the_line(q.a, p) * from_the_line(q.b, p)) < 0))
 
 
n, m = map(int, input().split())
polygon_points = []
polygon_lines = []
maxx = -math.inf
maxy = -math.inf
 
for i in range(n):
    x, y = map(int, input().split())
    p = Point(x, y)
    maxx = max(maxx, p.x)
    maxy = max(maxy, p.y)
    polygon_points.append(p)
    # if same_line(l1, l2) or end_intersection(l1, l2) or middle_intersection(l1, l2):
    #     print('YES')
    # else:
    #     print('NO')
# print(polygon_points)
 
 
for i in range(1, n):
    l = Line(polygon_points[i], polygon_points[i - 1])
    polygon_lines.append(l)
polygon_lines.append(Line(polygon_points[n - 1], polygon_points[0]))
 
 
for i in range(m):
    x, y = map(int, input().split())
    p = Point(x, y)
 
    on_the_border = False
    line = Line(p, Point(maxx * 10, maxy * 10 + 1))
    inter = 0
    for l in polygon_lines:
        if max(l.a.x, l.b.x) <= p.x or max(l.a.y, l.b.y) <= p.y:
            pass
        if on_the_line(p, l):
            on_the_border = True
            break
        if middle_intersection(line, l):
            inter += 1
    if on_the_border:
        print('BOUNDARY')
    elif inter % 2 == 0:
        print('OUTSIDE')
    else:
        print('INSIDE')
 
 

Test 1

Verdict: RUNTIME ERROR

File "input/code.py", line 53
    (from_the_line(q.a, p) * from_the_line(q.b, p)) < 0))...

Test 2

Verdict: RUNTIME ERROR

File "input/code.py", line 53
    (from_the_line(q.a, p) * from_the_line(q.b, p)) < 0))...

Test 3

Verdict: RUNTIME ERROR

File "input/code.py", line 53
    (from_the_line(q.a, p) * from_the_line(q.b, p)) < 0))...

Test 4

Verdict: RUNTIME ERROR

File "input/code.py", line 53
    (from_the_line(q.a, p) * from_the_line(q.b, p)) < 0))...

Test 5

Verdict: RUNTIME ERROR

File "input/code.py", line 53
    (from_the_line(q.a, p) * from_the_line(q.b, p)) < 0))...

Test 6

Verdict: RUNTIME ERROR

File "input/code.py", line 53
    (from_the_line(q.a, p) * from_the_line(q.b, p)) < 0))...

Test 7

Verdict: RUNTIME ERROR

File "input/code.py", line 53
    (from_the_line(q.a, p) * from_the_line(q.b, p)) < 0))...

Test 8

Verdict: RUNTIME ERROR

File "input/code.py", line 53
    (from_the_line(q.a, p) * from_the_line(q.b, p)) < 0))...

Test 9

Verdict: RUNTIME ERROR

File "input/code.py", line 53
    (from_the_line(q.a, p) * from_the_line(q.b, p)) < 0))...

Test 10

Verdict: RUNTIME ERROR

File "input/code.py", line 53
    (from_the_line(q.a, p) * from_the_line(q.b, p)) < 0))...

Test 11

Verdict: RUNTIME ERROR

File "input/code.py", line 53
    (from_the_line(q.a, p) * from_the_line(q.b, p)) < 0))...

Test 12

Verdict: RUNTIME ERROR

File "input/code.py", line 53
    (from_the_line(q.a, p) * from_the_line(q.b, p)) < 0))...

Test 13

Verdict: RUNTIME ERROR

File "input/code.py", line 53
    (from_the_line(q.a, p) * from_the_line(q.b, p)) < 0))...