def get_total_number_of_sequences(m, n):
    if n <= 0 or m <= 0:
        return 0

    prev = [1] * (m + 1)

    for _ in range(2, n + 1):
        curr = [0] * (m + 1)
        prefix = [0] * (m + 1)
        for i in range(1, m + 1):
            prefix[i] = prefix[i - 1] + prev[i]
        for x in range(1, m + 1):
            curr[x] = prefix[x // 2]
        prev = curr

    return sum(prev[1:])