### BUGGY CODE ###

def main():
    from collections import deque
    import sys
    sys.setrecursionlimit(10**8)
    stdin = sys.stdin
 
    ni = lambda: int(ns())
    na = lambda: list(map(int, stdin.readline().split()))
    ns = lambda: stdin.readline().rstrip()  # ignore trailing spaces
    
    n, m = na()
    
    nl = []
    for i in range(n):
        nl.append(na())
    ml = []
    for j in range(m):
        ml.append(na())
    
    xl = set([0])
    for hor in nl:
        xl.add(hor[0])
        xl.add(hor[1])
    for ver in ml:
        xl.add(ver[0])
    
    xl = list(xl)
    xl.sort()
    
    
    yl = set([0])
    for hor in nl:
        yl.add(hor[2])
    for ver in ml:
        yl.add(ver[1])
        yl.add(ver[2])
    
    yl = list(yl)
    yl.sort()
    
    dx = {}
    dy = {}
    for i in range(len(xl)):
        dx[xl[i]] = i

    for i in range(len(yl)):
        dy[yl[i]] = i

    h = len(xl)*2
    w = len(yl)*2
    d = [[0]*w for i in range(h)]

    for a,b,c in nl:
        s = dx[a]*2
        g = dx[b]*2
        t = dy[c]*2
        
        for x in range(s,g+1):
            d[x][t] = -1

    for a,b,c in ml:
        t = dx[a]*2
        s = dy[b]*2
        g = dy[c]*2
        
        for y in range(s,g+1):
            d[t][y] = -1


    def bfs(x,y):
        ans = 0
        dtx = [1,-1,0,0]
        dty = [0,0,1,-1]

        sx = dx[x]*2
        sy = dy[y]*2
        q = deque([])
        q.append((sx,sy))
        d[sx][sy] = 1
        while q:
            bx,by = q.popleft()

            for i in range(4):
                nx = bx+dtx[i]
                ny = by+dty[i]

                if 0 <= nx < h and 0 <= ny < w and d[nx][ny] == 0:
                    if nx == 0 or ny == 0 or nx == h-1 or ny == w-1:
                        print("INF")
                        exit()
                    d[nx][ny] = 1
                    if nx%2 != 0 and ny%2 != 0:
                        ax = xl[nx//2+1]-xl[nx//2]
                        ay = yl[ny//2+1]-yl[ny//2]
                        ans += ax*ay
                    q.append((nx,ny))
        print(ans)

    bfs(0,0)
if __name__ == "__main__":
    main()

### FIXED CODE ###

from bisect import bisect_left as bl
from collections import deque
import sys
sys.setrecursionlimit(10**8)
input = sys.stdin.readline
n,m = map(int,input().split())
H = set([float("INF"),-float("INF")])
V = set([float("INF"),-float("INF")])
nl = []
ml = []
for i in range(n):
    a,b,c = map(int,input().split())
    H |= set([a,b])
    V.add(c)
    nl.append([a,b,c])
for i in range(m):
    c,a,b = map(int,input().split())
    V |= set([a,b])
    H.add(c)
    ml.append([a,b,c])
def compress(L):
    L2 = list(set(L))
    L2.sort()
    C = {v : k for k, v in enumerate(L2)}
    return L2, C
H ,dx = compress(H)
V, dy = compress(V)

h = len(H)+2
w = len(V)+2
d = [[0]*3001 for i in range(3001)]
checkh = [[0]*3001 for i in range(3001)]
checkv = [[0]*3001 for i in range(3001)]

for a,b,c in nl:
    s = dx[a]
    g = dx[b]
    t = dy[c]
    
    for x in range(s,g):
        checkh[x][t] = 1

for a,b,c in ml:
    s = dy[a]
    g = dy[b]
    t = dx[c]
    
    for y in range(s,g):
        checkv[t][y] = 1


def bfs(x,y):
    ans = 0
    sx = bl(H,0)-1
    sy = bl(V,0)-1
    q = deque([])
    q.append((sx,sy))
    d[sx][sy] = 1
    while q:
        h,v = q.popleft()
        ans += (H[h+1]-H[h])*(V[v+1]-V[v])
        if h != 0 and checkv[h][v] == 0 and d[h-1][v] == 0:
            d[h-1][v] = 1
            q.append((h-1,v))
        if v != 0 and checkh[h][v] == 0 and d[h][v-1] == 0:
            d[h][v-1] = 1
            q.append((h,v-1))
        if h != len(H)-2 and checkv[h+1][v] == 0 and d[h+1][v] == 0:
            d[h+1][v] = 1
            q.append((h+1,v))
        if v != len(V)-2 and checkh[h][v+1] == 0 and d[h][v+1] == 0:
            d[h][v+1] = 1
            q.append((h,v+1))
    print("INF" if ans ==float("INF") else ans)

bfs(0,0)