#include #define rep(i,n) for(long long i=0;i<(n);++i) using namespace std; typedef long long ll; typedef pair P; ll L, R, N; ll countMultiple(ll R, ll div, ll mod) { if (R == 0) return 0; ll res = R / div; if (mod <= R % div and 0 < mod) res++; return res; } ll countMultiple(ll L, ll R, ll div, ll mod) {//[L,R] and x % div = mod return countMultiple(R, div, mod) - countMultiple(L - 1, div, mod); } int main() { ios::sync_with_stdio(false); cin.tie(0); cin >> L >> R >> N; rep(i, N) cout << countMultiple(L, R, N, i) << endl; }