#include using namespace std; int main() { int m, n, x; long long dp[1000] = {}; int a[10001] = {}; cin >> n >> m; for (int i = 0; i < m; i++) { cin >> x; a[x] = 1; } if (a[0] == 0) dp[0] = 1; if (a[1] == 0) dp[1] = 1; if (a[2] == 0) dp[2] = dp[1] + dp[0]; for (int i = 3; i <= n; i++) { if (a[i] == 1) { dp[i] = 0; } else { dp[i] = ((dp[i - 1])%12345 + (dp[i - 2])%12345 + (dp[i - 3])%12345)%12345; } } cout << dp[n] << endl; return 0; }