#include <bits/stdc++.h>
using namespace std;
const int MN = 2e5 + 200;
vector<int> primes[MN];
int dp[MN], p[MN];
vector<int> gc[MN];
bool mark[MN];
vector<int> ans;
int modi(int a, int m) {
  int m0 = m, t, q;
  int x0 = 0, x1 = 1;
  if (m == 1) return 0;
  while (a > 1) {
    q = a / m;
    t = m;
    m = a % m, a = t;
    t = x0;
    x0 = x1 - q * x0;
    x1 = t;
  }
  if (x1 < 0) x1 += m0;
  return x1;
}
int gcd(int a, int b) {
  if (b == 0) {
    return a;
  } else {
    return gcd(b, a % b);
  }
}
int main() {
  ios::sync_with_stdio(0);
  int n, m;
  cin >> n >> m;
  for (int i = 0; i < n; i++) {
    int t;
    cin >> t;
    mark[t] = 1;
  }
  for (int i = 2; i <= m; i++) {
    if (!primes[i].size()) {
      for (int j = i; j <= m; j += i) {
        primes[j].push_back(i);
      }
    }
  }
  for (int i = 0; i < m; i++) {
    if (!mark[i]) {
      gc[gcd(i, m)].push_back(i);
    }
  }
  for (int i = 1; i <= m; i++) {
    if (m % i == 0) {
      p[i] = 1;
      for (int j : primes[i]) {
        if (dp[i / j] >= dp[p[i]]) {
          p[i] = i / j;
        }
      }
      dp[i] = dp[p[i]] + gc[i].size();
    }
  }
  int mi = m;
  while (true) {
    for (int j : gc[mi]) {
      ans.push_back(j);
    }
    if (p[mi] == mi) break;
    mi = p[mi];
  }
  reverse(ans.begin(), ans.end());
  cout << ans.size() << endl;
  cout << ans[0] << " ";
  for (int i = 1; i < ans.size(); i++) {
    cout << (1ll *
             modi(ans[i - 1] / gcd(ans[i - 1], m), m / gcd(ans[i - 1], m)) *
             (ans[i] / gcd(ans[i - 1], m))) %
                m
         << " ";
  }
}
