you give undirected unweighted graph consist n vertex m edgesyou write number vertex graph each number 1 2 3 the graph beautiful edge sum number vertice connect edge oddcalculate number possible way write number 1 2 3 vertex graph beautiful since number large print modulo 998244353note write exactly number vertexthe graph selfloop multiple edge