#include <cstdio>
#include <map>
#include <vector>
#include <stdint.h>

int64_t qs[100001];
std::map<int64_t,int64_t> map;

int64_t sum[100001];

int main(){
  int64_t N,Q;
  scanf("%ld %ld",&qs[0],&Q);
  for(int64_t i=1;i<=Q;i++){
    scanf("%ld",&qs[i]);
  }
  map[qs[Q]]=1;
  for(int64_t i=Q;i>=0;i--){
    int64_t Q=qs[i];
    while(map.rbegin()->first>Q){
      int64_t x=map.rbegin()->first;
      int64_t cnt=map.rbegin()->second;
      map.erase(map.rbegin()->first);
      map[x%Q]+=cnt;
      map[Q]+=cnt*(x/Q);
    }
  }
  for(auto it:map){
    sum[it.first]=it.second;
  }
  for(int64_t i=qs[0];i>0;i--){
    sum[i-1]+=sum[i];
  }
  for(int64_t i=1;i<=qs[0];i++){
    printf("%ld\n",sum[i]);
  }
  return 0;
}
