#include #define rep(i,n) for(int i = 0; i < (n); ++i) #define srep(i,s,t) for (int i = s; i < t; ++i) #define drep(i,n) for(int i = (n)-1; i >= 0; --i) using namespace std; typedef long long int ll; typedef pair P; #define yn {puts("Yes");}else{puts("No");} #define MAX_N 200005 int main() { ll l,r,n; cin >> l >> r >> n; rep(i,n){ ll ans = 0; if(i == 0){ ans = r / n - (l-1) / n; }else{ if(r-i >= 0)ans += (r-i) / n; if(l-1-i >= 0)ans -= (l-1-i) / n; } cout << ans << endl; } return 0; }