CF1866H.Happy Sets
普及/提高-
通过率:0%
AC君温馨提醒
该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。
题目描述
Define a set A as a child of set B if and only if for each element of value x that is in A , there exists an element of value x+1 that is in B .
Given integers N and K . In order to make Chaneka happy, you must find the number of different arrays containing N sets [S1,S2,S3,…,SN] such that: - Each set can only contain zero or more different integers from 1 to K . - There exists a way to rearrange the order of the array of sets into [S1′,S2′,S3′,…,SN′] such that Si′ is a child of Si+1′ for each 1≤i≤N−1 .
Print the answer modulo 998244353 .
Two sets are considered different if and only if there is at least one value that only occurs in one of the two sets.
Two arrays of sets are considered different if and only if there is at least one index i such that the sets at index i in the two arrays are different.
输入格式
The only line contains two integers N and K ( 1≤N,K≤2⋅105 ) — the number of sets in the array and the maximum limit for the values in the sets.
输出格式
An integer representing the number of different arrays of sets that satisfy the problem condition, modulo 998244353 .
输入输出样例
输入#1
2 2
输出#1
11
输入#2
1 3
输出#2
8
输入#3
3 1
输出#3
4
说明/提示
In the first example, there are 11 different arrays of sets possible, which are:
- [{},{}]
- [{},{1}]
- [{},{1,2}]
- [{},{2}]
- [{1},{}]
- [{1},{1,2}]
- [{1},{2}]
- [{1,2},{}]
- [{1,2},{1}]
- [{2},{}]
- [{2},{1}]