Note: This is an advanced version of Tic-Tac-Toe. It is highly recommended to solve the $3 \times 3$ version first to understand basic state management before attempting this scalable version.

Traditionally, Tic-Tac-Toe uses a fixed 3 X 3 grid. In this challenge, you must build an advanced engine that supports an N X N board where a player wins by connecting M marks in a row.

Requirements:

Dynamic Grid: Render an N X N board (e.g., 5 X 5).
Flexible Win Condition: A player wins if they place M marks (e.g., M=4) in a horizontal, vertical, or diagonal line.
Turn Management: Players (X and O) alternate turns.
Game Status: Display the current turn, the winner, or a draw at the top.
Reset Logic: A button to clear the board and start a new game.