#include<iostream>
using namespace std;
int gcd(int a, int b)
{
if (b == 0)return a;
else return gcd(b, a % b);
}
int main()
{
//已知互质的正整数n和a，a<n，b<n并且(a*b)%n=1。
//a*b-1==k*n;
int a, n; cin >>a>> n;
int b[10000] = { 0 };
int c[10000] = { 0 };
int i = 0;
for (int i= 0; i < n; i++)
cin >> b[i];
for (int i = 0; i < n; i++)
{
for (int j = 0; j < a; j++)
{
if (gcd(a, b[i]) == 1 && j * b[i] % a == 1) { c[i] = j; break; }
else c[i] = 0;
}
}
for (int i = 0; i < n; i++)
cout << c[i]<<" \n"[i==n-1];
return 0;
}