{"raw_statement":[{"iden":"statement","content":"Sequence  of positive integers is given to you. A sequence of positive integers is called Rasta - made if and only if every two consecutive elements from this sequence are coprimes to each other. \n\nA Rasta - making operation on a sequence consists of choosing two non-coprime consecutive elements from it and divide them both by one of their common prime factors. For example, we can turn the seqeunce  to  with performing one operation.\n\nPhoulady number of a sequence is the minimum number of Rasta - making operations needed for turning it into a Rasta - made sequence.\n\nConstruction number of a a sequence is the number of different sequences we can get by performing 0 or more Rasta - making operations.\n\nWe show Phoulady number by F and Construction number by S.\n\nIn all subtasks:\n\nSubtasks:\n\nEach subtask consists of one testcase.\n\nInput consists of two integers, n and M.\n\nPrint the answer modulo 109 + 7 in a single line.\n\n"},{"iden":"input","content":"Each subtask consists of one testcase.Input consists of two integers, n and M."},{"iden":"output","content":"Print the answer modulo 109 + 7 in a single line."},{"iden":"examples","content":""}],"translated_statement":null,"sample_group":[],"show_order":[],"formal_statement":"**Definitions**  \nLet $ n, M \\in \\mathbb{Z}^+ $.  \nLet $ \\mathcal{S} $ be the set of all sequences $ A = (a_1, a_2, \\dots, a_n) $ such that $ a_i \\in \\{1, 2, \\dots, M\\} $ for all $ i $.  \n\nA sequence $ A $ is **#cf_span[Rasta-made]** if $ \\gcd(a_i, a_{i+1}) = 1 $ for all $ i \\in \\{1, \\dots, n-1\\} $.  \n\nA **#cf_span[Rasta-making] operation** on $ A $ selects an index $ i \\in \\{1, \\dots, n-1\\} $ such that $ \\gcd(a_i, a_{i+1}) > 1 $, chooses a prime $ p \\mid \\gcd(a_i, a_{i+1}) $, and replaces $ a_i \\leftarrow a_i/p $, $ a_{i+1} \\leftarrow a_{i+1}/p $.  \n\nLet $ F(A) $ be the minimum number of #cf_span[Rasta-making] operations to make $ A $ #cf_span[Rasta-made].  \nLet $ S(A) $ be the number of distinct sequences obtainable from $ A $ via any number of #cf_span[Rasta-making] operations.  \n\n**Objective**  \nCompute:  \n$$\n\\sum_{A \\in \\mathcal{S}} F(A) \\quad \\text{and} \\quad \\sum_{A \\in \\mathcal{S}} S(A)\n$$  \nmodulo $ 10^9 + 7 $.  \n\n**Constraints**  \n$ 1 \\leq n \\leq 50 $, $ 1 \\leq M \\leq 50 $.","simple_statement":"Given a sequence of positive integers, you can perform an operation: pick two consecutive numbers that are not coprime, and divide both by one of their common prime factors.  \n\nDefine:  \n- **Phoulady number (F)**: minimum operations to make all consecutive pairs coprime.  \n- **Construction number (S)**: total number of different sequences you can get using any number of such operations.  \n\nGiven n and M, compute F and S modulo 10^9+7.","has_page_source":false}