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

    dp = [1] * (m + 1)

    for _ in range(2, n + 1):
        new_dp = [0] * (m + 1)
        prefix_sum = [0] * (m + 1)

        for value in range(1, m + 1):
            prefix_sum[value] = prefix_sum[value - 1] + dp[value]

        for last_value in range(1, m + 1):
            limit = last_value // 2
            new_dp[last_value] = prefix_sum[limit]

        dp = new_dp

    return sum(dp[1:])