종류별 묶음 포장

#include <iostream>
#include <vector>
using namespace std;

vector<int> collect(vector<int> kinds, int m) {
    vector<int> counts(m + 1, 0);
    for (int i = 0; i < (int)kinds.size(); ++i) {
        /*@blank1@*/ += 1;
    }
    return counts;
}
int measure(int count, int size) {
    int full = /*@blank2@*/;
    return count - full * size;
}
int solution(vector<int> kinds, int m, int size) {
    vector<int> counts = collect(kinds, m);
    int answer = 0;
    for (int kind = 1; kind <= m; ++kind) {
        answer += /*@blank3@*/;
    }
    return answer;
}
int main() {
    int n, m, size; cin >> n >> m >> size;
    vector<int> kinds(n);
    for (int i = 0; i < n; ++i) cin >> kinds[i];
    cout << solution(kinds, m, size) << '\n';
    return 0;
}