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

int main() {
    int N, M;
    cin >> N >> M;

    queue<int> progression;

    int firstTerm = N % M;
    if (firstTerm == 0)
        firstTerm = M;

    firstTerm = firstTerm % M;

    for (int i = firstTerm; i <= N; i += M) {
        progression.push(i);
    }

    while (!progression.empty()) {
        cout << progression.front() << " ";
        progression.pop();
    }

    return 0;
}