#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for(int i = (int)(n - 1); i >= 0; i--)
template <typename T> bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template <typename T> bool chmin(T &a,const T &b){if(a>b){a=b;return true;}return false;}
using ll = long long;
#define int ll
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vb = vector<bool>;
using vvb = vector<vector<bool>>;
using vs = vector<string>;
using pii = pair<int, int>;
// using mint = modint!!!number!!!;

signed main(){
  int n, m; cin >> n >> m;
  vi a(n); rep(i, n) cin >> a.at(i);
  for(int k = 1; k <= n; k++){
  	int ans = 0;
  	set<int> mex;
  	map<int, int> mp;
  	rep(i, n + 1) mex.insert(i);
  	rep(i, k){
  		if(mex.contains(a.at(i))) mex.erase(a.at(i));
  		if(mp.contains(a.at(i))) mp.at(a.at(i))++;
  		else mp.emplace(a.at(i), 1);
  	}
  	if(*mex.begin() >= m) ans++;
  	rep(i, n - k){
  		if(mex.contains(a.at(k + i))) mex.erase(a.at(k + i));
  		if(mp.contains(a.at(k + i))) mp.at(a.at(k + i))++;
  		else mp.emplace(a.at(i), 1);
  		if(mp.contains(a.at(i))){
  			mp.at(a.at(i))--;
  		    if(mp.at(a.at(i)) == 0) mex.insert(a.at(i));
  		}
  		if(*mex.begin() >= m) ans++;
  	}
  	cout << ans << endl;
  }
}