uva10825

#include <iostream>
#include <istream>
#include <sstream>
#include <vector>
#include <stack>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <numeric>
#include <chrono>
#include <ctime>
#include <cmath>
#include <cctype>
#include <string>
#include <cstdio>
#include <iomanip>


#include <thread>
#include <mutex>
#include <condition_variable>
#include <functional>
#include <iterator>
using namespace std;

int n, m,vis[404], ans[10];

bool check(int c) {
	int sum = 0, val = 0, cnt[404] = {0};
	for (int i = m - 1; i >= 0; i--) {
		sum += ans[i] * c;
		int t = sum % n;
		if (++cnt[t] > vis[t]) return false;
		sum /= n;
	}
	return true;
}
bool solve(int last) {
	int sum = last;
	memset(vis, 0, sizeof(vis));

	ans[m - 1] = last;
	vis[last]++;
	for (int i = m - 2; i >= 0; i--) {
		sum = (sum + last) % n;
		ans[i] = sum;
		vis[sum]++;
	}

	sort(ans, ans + m - 1);
	do {
		bool ok = true;
		for (int i = 2; i <= m; i++) {
			if (!check(i)) {
				ok = false;
				break;
			}
		}
		if (ok) return true;
	} while (next_permutation(ans, ans + m - 1));

	return false;
}

int main()
{
	while (cin >> m >> n && (m || n)) {
		bool ok = false;
		for (int i = 1; i < n; i++) {
			if (solve(i)) {
				ok = true;
				break;
			}
		}
		if (ok) {
			for (int i = 0; i < m; i++) {
				if (i) cout << " "<< ans[i] ;
				else cout << ans[i];
			}
			cout << endl;
		}else
			cout << "Not found." << endl;
	}
	return 0;
}