func_code_string: #include <bits/stdc++.h>   using namespace std;   const int N = 1e6 + 100;   int n, m, k, a[N];   bool mark[N];   int main() {     cin >> n >> m >> k;     for (int i = 1; i <= n; i++) cin >> a[i], mark[a[i]] = 1;     deque<int> que;     int ans = 0;     for (int i = 1; i < N; i++) {       while (que.size() && que.front() <= i - m) que.pop_front();       if (mark[i]) que.push_back(i);       if (que.size() >= k)         while (que.size() >= k) que.pop_back(), ans++;     }     cout << ans << endl;     return 0;   }   