import java.io.*;
import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);

        int m = in.nextInt();
        int n = in.nextInt();
        int[][] mA = new int[n][m + 1];
        int[] P = new int[n];
        for (int i = 0; i < n; i++) {
            P[i] = in.nextInt();
        }

        for (int i = 0; i < n; i++) {
            mA[i][0] = 1;
        }
        for (int j = 0; j < m + 1; j++) {
            if (j % P[0] == 0) mA[0][j] = 1;
        }
        for (int i = 1; i < n; i++) {
            for (int j = 1; j < m + 1; j++) {
                if (j < P[i]) {
                    mA[i][j] = mA[i - 1][j];
                } else {
                    mA[i][j] = mA[i - 1][j] + mA[i][j - P[i]];
                }
            }
        }
        System.out.println(mA[n - 1][m]);

        in.close();
    }
}