#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <assert.h>
#include <iostream>
#include <fstream>
#include <string>

using namespace std;

#define MaxN 1000000
#define MaxM 2*2*2*2*2*2*2*2*2*2*2*2*2*2*2*2*2*2*2*2*2*2*2*2*2*2*2*2*2*2*2

bool trovaM(int seq[], int M, int N, int i)
{
	int k,ParSum;
	ParSum = 0;
	for(k=i;k<N;k++)
	{
		ParSum += seq[i];
		if(ParSum==M) return true;
		else if(ParSum>M) return false;	 
	}
}

int main(int argc, char *argv[])
{
	int M,N;
	int i,j;
	int numSeq = 0;

	FILE *fin, *fout;
	fin = fopen("/home/esame/Desktop/TEMA_OGGI/3.numeri/input/input1.txt","r");
	fout = fopen("output.txt","w");
	
	fscanf(fin, "%d", &M); cout << "M: " << M << endl;
	fscanf(fin, "%d", &N); cout << "N: " << N << endl;

	int *S = new int[N];
	for(i=0;i<N;i++) { fscanf(fin, "%d", &S[i]); /* cout << "S[" << i << "]: " << S[i] << " "; */ }
	cout << endl;

	// Ricorsione su somme parziali
	for(i=0;i<N;i++)
	{
		if(trovaM(S,M,N,i)) numSeq++;	
	}
	
	cout << "NumSeq: " << numSeq << endl;
	cout << endl;	
	
	fprintf(fout, "%d\n", numSeq);
	
	
return 0;
}