#include <vector>
#include <cassert>
#include <utility>


namespace nachia{

template<class Elem>
struct MatrixModulo{
private:
    int h;
    int w;
    std::vector<Elem> elems;

public:
    
    MatrixModulo(int new_h, int new_w){ h = new_h; w = new_w; elems.assign(h * w, 0); }
    MatrixModulo(const MatrixModulo&) = default;
    int height() const { return h; }
    int width() const { return w; }
    typename std::vector<Elem>::iterator operator[](int y){ return elems.begin() + (y * w); }
    typename std::vector<Elem>::const_iterator operator[](int y) const { return elems.begin() + (y * w); }
    static MatrixModulo identity(int idx){ auto res = MatrixModulo(idx, idx); for(int i = 0; i < idx; i++) res[i][i] = 1; return res; }
    MatrixModulo operator*(const MatrixModulo& r) const {
        assert(width() == r.height());
        auto res = MatrixModulo(h, r.w);
        for (int i=0; i<h; i++) for (int j=0; j<w; j++) for (int k=0; k<r.w; k++) res[i][k] += (*this)[i][j] * r[j][k];
        return res;
    }
    Elem det() const {
        assert(height() == width());
        MatrixModulo g = *this;
        Elem ans = 1;
        for (int i=0; i<h; i++) {
            int tg = -1;
            for (int j=i; j<h; j++) { if (g[j][i].val() != 0) tg = j; }
            if (tg == -1) return 0;
            if (tg != i) ans = -ans;
            for (int j=0; j<h; j++) std::swap(g[i][j], g[tg][j]);
            tg = i;
            ans *= g[i][i];
            Elem const_coeff = g[i][i].inv();
            for (int j=0; j<h; j++) g[i][j] *= const_coeff;
            for (int j=i+1; j<h; j++) for(int k=h-1; k>=i; k--) g[j][k] -= g[j][i] * g[i][k];
        }
        return ans;
    }
    int rank() const {
        MatrixModulo g = *this;
        int y = 0;
        for (int d=0; d<w; d++) {
            if(y == h) break;
            int tg = -1;
            for (int i=y; i<h; i++) { if (g[i][d].val() != 0){ tg = i; break; } }
            if (tg == -1) continue;
            for (int j=d; j<w; j++) std::swap(g[y][j], g[tg][j]);
            tg = y;
            Elem const_coeff = g[y][d].inv();
            for (int j=d; j<w; j++) g[y][j] *= const_coeff;
            for (int i=y+1; i<h; i++) for(int j=w-1; j>=d; j--) g[i][j] -= g[i][d] * g[y][j];
            y++;
        }
        return y;
    }
    MatrixModulo linear_equation() const {
        MatrixModulo g = *this;
        int y = 0;
        std::vector<std::pair<int,int>> det_var;
        std::vector<int> rank_var;
        for (int d=0; d<w-1; d++) {
            int tg = -1;
            for (int i=y; i<h; i++) { if (g[i][d].val() != 0){ tg = i; break; } }
            if (tg == -1){ rank_var.push_back(d); continue; }
            for (int j=d; j<w; j++) std::swap(g[y][j], g[tg][j]);
            tg = y;
            Elem const_coeff = g[y][d].inv();
            for (int j=d; j<w; j++) g[y][j] *= const_coeff;
            for (int i=0; i<h; i++) if (i != y) for(int j=w-1; j>=d; j--) g[i][j] -= g[i][d] * g[y][j];
            det_var.push_back(std::make_pair(d,y));
            y++;
        }
        for (int i=y; i<h; i++) if (g[i][w-1].val() != 0) return MatrixModulo(0,0);
        MatrixModulo solution(1 + rank_var.size(), w);
        for (auto [x,i] : det_var) { solution[0][x] = -g[i][w-1]; }
        solution[0][w-1] = 1;
        for (int d=0; d<(int)rank_var.size(); d++) {
            int varid = rank_var[d];
            solution[d+1][varid] = -Elem(1);
            for (auto [x,i] : det_var) { solution[d+1][x] = g[i][varid]; }
        }
        return solution;
    }
    MatrixModulo pow(unsigned long long i){
        auto a = *this;
        auto res = identity(height());
        while(i){
            if(i % 2 == 1) res = res * a;
            a = a * a;
            i /= 2;
        }
        return res;
    }
};


} // namespace nachia

#include <iostream>
#include <algorithm>
#include <atcoder/modint>
using namespace std;


using i64 = long long;
using u64 = unsigned long long;
using i32 = int;
using u32 = unsigned int;
#define rep(i,n) for(int i=0; i<(int)(n); i++)


using modint = atcoder::static_modint<1'000'000'007>;
using matrix = nachia::MatrixModulo<modint>;


int main() {
    i64 L,N,M; cin >> L >> N >> M;
    vector<int> K(M);
    rep(i,N) cin >> K[i];

    vector<int> exK(N, 0);
    for(auto a : K) exK[a-1] = 1;
    vector<int> I(N+1);
    I[0] = 1;
    rep(i,N) I[i+1] = I[i] + i+2;

    matrix G(I[N]+1, I[N]+1);
    rep(i,N) G[0][I[i]] += 1;
    rep(s,N) rep(t,N) if(s != t) for(int ss=I[s]; ss<I[s+1]; ss++) G[ss][I[t]] += 1;
    rep(s,N) for(int ss=I[s]; ss+1<I[s+1]; ss++) G[ss][ss+1] += 1;
    rep(s,N) G[I[s+1]-1][I[s+1]-1] += 1;
    rep(s,N) if(exK[s]){
        rep(i,I[N]+1) G[I[s]+s][i] = 0;
        G[I[s]+s][I[N]] += (N-1);
        G[I[s]+s][I[s]+s+1] += 1;
    }
    G[I[N]][I[N]] += N;
    
    //rep(y,I[N]+1){
    //    rep(i,I[N]+1) cout << G[y][i].val() << ' ';
    //    cout << endl;
    //}
    //cout << endl;

    G = G.pow(L);
    modint ans = G[0][I[N]];
    //rep(i,I[N]+1) cout << G[0][i].val() << ' ';
    //cout << endl;
    rep(s,N) if(exK[s]) ans += G[0][I[s]+s];
    cout << ans.val() << endl;
    return 0;
}




struct ios_do_not_sync{
    ios_do_not_sync(){
        std::ios::sync_with_stdio(false);
        std::cin.tie(nullptr);
    }
} ios_do_not_sync_instance;