#include <bits/stdc++.h>
#include <atcoder/modint>
using namespace std;
using namespace atcoder;
//#pragma GCC optimize("Ofast")
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)
#define Rrep(i,n) Rreps(i,n,0)
#define ALL(a) a.begin(), a.end()

using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;

ll N,M,H,W,Q,K,A,B;
string S;
using P = pair<ll, ll>;
using tp = tuple<ll, ll, ll>;
const ll INF = (1LL<<60);

template<class T> bool chmin(T &a, const T b){
    if(a > b) {a = b; return true;}
    else return false;
}
template<class T> bool chmax(T &a, const T b){
    if(a < b) {a = b; return true;}
    else return false;
}
template<class T> void my_printv(std::vector<T> v,bool endline = true){
    if(!v.empty()){
        for(std::size_t i{}; i<v.size()-1; ++i) std::cout<<v[i]<<" ";
        std::cout<<v.back();
    }
    if(endline) std::cout<<std::endl;
}

using mint = modint;

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cin>>N>>K;
    mint::set_mod(K);
    vector<int> c(10, 0), d(10, 0);
    rep(i, 9) cin>>c[i + 1];
    unordered_map<ll, unordered_map<int, int> > memo;
    mint sum(0), ten(1);
    ll res{};
    auto my_hash = [](vector<int> v){
        ll res{};
        reps(i, 1, 10) (res *= 15) += v[i];
        return res;
    };
    auto dfs = [&](auto &&self, bool bef, int num) -> void{
        if(num == 0){
            if(bef) ++memo[my_hash(d)][sum.val()];
            else {
                res += memo[my_hash(c)][(K - sum * ten).val()];
                /*
                cout<<(K - sum * ten).val()<<endl;
                my_printv(c);
                cout<<res<<endl;
                 */
            }
        }else{
            reps(i, 1, 10) {
                if (bef ? c[i] > d[i] : c[i] > 0) {
                    bef ? ++d[i] : --c[i];
                    mint tmp = sum;
                    (sum *= 10) += i;
                    self(self, bef, num - 1);
                    sum = tmp;
                    bef ? --d[i] : ++c[i];
                }
            }
        }
    };
    dfs(dfs, true, (N + 1) / 2);
    rep(i, (N + 1) / 2) ten *= 10;
    dfs(dfs, false, N / 2);
    cout<<res<<endl;
}