#include<bits/stdc++.h>
#define L(i, j, k) for(int i = (j); i <= (k); i++)
#define R(i, j, k) for(int i = (j); i >= (k); i--)
#define ll long long
#define ull unsigned long long 
#define sz(a) ((int) a.size())
#define vi vector<int>
#define me(a, x) memset(a, x, sizeof(a))
using namespace std;
const int N = 2e6 + 7;

namespace fastgcd {
const int v = 2000000, radio = 1454;
int np[v + 10], prime[v + 10], cnt;
int k[v + 10][3];
int _gcd[radio + 10][radio + 10];
inline bool gcd(int a, int b) {
	if(!a) return b == 1;
    for(int i = 0; i < 3; i++) {
        if(k[a][i] > radio) {
            if(b % k[a][i] == 0) return false; 
        }
        else if(k[a][i] > 1 && !_gcd[k[a][i]][b % k[a][i]]) return false;
    }
    return true;
}
int Main() {
    k[1][0] = k[1][1] = k[1][2] = 1;
    np[1] = 1;
    for(int i = 2; i <= v; i++) {
        if(!np[i]) prime[++cnt] = i, k[i][2] = i, k[i][1] = k[i][0] = 1;
        for(int j = 1; prime[j] * i <= v; j++) {
            np[i * prime[j]] = 1;
            int *tmp = k[i * prime[j]];
            tmp[0] = k[i][0] * prime[j];
            tmp[1] = k[i][1];
            tmp[2] = k[i][2];
            if(tmp[1] < tmp[0]) swap(tmp[1], tmp[0]);
            if(tmp[2] < tmp[1]) swap(tmp[2], tmp[1]);
            if(i % prime[j] == 0) break;
        }
    }
    
    _gcd[1][0] = _gcd[0][1] = true;
    for(int _max = 1; _max <= radio; _max++)
        for(int i = 1; i <= _max; i++) 
            _gcd[i][_max] = _gcd[_max][i] = _gcd[_max % i][i];
    return 0;
}

}

int n, MOD[N], mat[N];
string xn;

// gcd(n + 2j + 1, n - 2k + 2i + 1) = 1
// gcd(M_{j + k - i} + 2j + 1, j + k - i) = 1

bool vis[N];
int arr[N], tot;

bool fi;
mt19937_64 orz;

inline int gcd(int x, int y) {
	assert(y > 0);
	return fastgcd :: gcd(y, x);
}

vi st, g;

int del; 
bool dfs(int x) {
	if(sz(st)) {
	R(p, sz(st) - 1, 0) {
		int i = st[p];
		if(gcd(MOD[i + n - x] + 2 * i + 1, i + n - x)) {
			mat[i] = x;
			del = i;
			return true;
		}
	}
	}
	if(!fi) {
		fi = true;
		L(u, 0, 30) {
			int i = (x + 4000 + u) % n;
			if(!vis[i] && !~mat[i] && gcd(MOD[i + n - x] + 2 * i + 1, i + n - x)) {
				vis[i] = true;
				arr[++tot] = i;
				if(!~mat[i] || dfs(mat[i])) {
					return mat[i] = x, true;
				} 
				// matrix casacde. 
			}
		}
		L(u, 0, n - 1) {
			int i = (x + 4000 + u) % n;
			if(!vis[i] && gcd(MOD[i + n - x] + 2 * i + 1, i + n - x)) {
				vis[i] = true;
				arr[++tot] = i;
				if(!~mat[i] || dfs(mat[i])) {
					return mat[i] = x, true;
				} 
				// matrix casacde. 
			}
		}
	} else {
		int i = orz() % n;
		L(u, 0, n - 1) {
			if(!vis[i] && gcd(MOD[i + n - x] + 2 * i + 1, i + n - x) == 1) {
				vis[i] = true;
				arr[++tot] = i;
				if(!~mat[i] || dfs(mat[i])) 
					return mat[i] = x, true;
				arr[++tot] = i;
				// matrix casacde. 
			}
			++i;
			if(i >= n) i -= n;
		}
	}
	return false;
}

bool Prime[N], tmp[N];
int prime[N], xtot, ns[N];

ll M = -1;
inline int Get(int md) {
	int cur = 0;
	for(auto u : xn) 
		cur = (cur * 10 + u - '0') % md;
	return cur;
}
void init() {
	if(M != -1) {
		L(i, 1, n * 2) MOD[i] = M % (i * 2);
		return ;
	}
	MOD[1] = Get(2);
	L(i, 2, n * 2) {
		if(!Prime[i]) prime[++xtot] = i, MOD[i] = Get(i * 2);
		for(int j = 1; j <= xtot && prime[j] * i <= n * 2; j++) {
    		Prime[i * prime[j]] = 1;
			if(i % prime[j] == 0) {
				int x = i, y = prime[j];
				while(x % prime[j] == 0) x /= prime[j], y *= prime[j];
				
				if(x == 1) {
					MOD[i * prime[j]] = Get(y * 2);
					continue;
				} 
				
				if(y > 350) {
					MOD[i * prime[j]] = Get(i * prime[j] * 2);
					break;
				}
				
				for(int cur = MOD[x]; ; cur += x * 2) 
					if(cur % (y * 2) == MOD[y]) {
						MOD[i * prime[j]] = cur;
						break;
					}
				break;	 
			} 
			if(prime[j] > 350) {
				MOD[i * prime[j]] = Get(i * prime[j] * 2);
				continue;
			}
			for(int cur = MOD[i]; ; cur += i * 2) 
				if(cur % (prime[j] * 2) == MOD[prime[j]]) {
					MOD[i * prime[j]] = cur;
					break;
				}
		}
	}
}

int main () {
	ios :: sync_with_stdio(false);
	cin.tie (0); cout.tie(0); 
//	xn = "2000000", n = 1e6;

	cin >> xn >> n;	
	fastgcd :: Main();
//	
//	L(i, 1, n * 2) {
//		int md = i * 2, cur = 0;
//		for(auto u : xn) 
//			cur = (cur * 10 + u - '0') % md;
//		MOD[i] = cur;
//	}

	if(sz(xn) <= 10) {
		M = 0;
		for(auto u : xn) 
			M = M * 10 + u - '0';
	}
	init();
	
	L(i, 0, n - 1) 
		mat[i] = -1;
	
	if(n < 1e5) {
	L(i, 0, n - 1) {
		fi = 0;
		dfs(i);
		L(j, 1, tot) 
			vis[arr[j]] = false;
		tot = 0;
	}
	} else { 
	const int T = n - 5000;
	L(i, 0, T) {
		fi = 0;
		dfs(i);
		L(j, 1, tot) 
			vis[arr[j]] = false;
		tot = 0;
	}
	L(i, 0, n - 1) 
		if(mat[i] == -1) 
			st.emplace_back(i);
	L(i, T + 1, n - 1) {
		fi = 0;
		dfs(i);
		L(j, 1, tot) vis[arr[j]] = false;
		tot = 0;
		st.erase(lower_bound(st.begin(), st.end(), del));
	}
	}
	
	cout << n << '\n';
	L(i, 0, n - 1) {
		cout << n - mat[i] << '\n';
	}
	return 0;
}