#include <iostream>
using namespace std;

const int MAX_N = 20;

int main() {
    int n, m;
    cin >> n >> m;                 // 子題組 1 保證 m = 1：每群只有一個數，選的就是它
    int chosen[MAX_N];             // 每一群選出來的數字
    int sum = 0;
    for (int i = 0; i < n; i++) {
        cin >> chosen[i];
        sum += chosen[i];
    }

    cout << sum << '\n';
    bool printed = false;          // 第二行印過數字了嗎？決定要不要先印空白、最後要不要印 -1
    for (int i = 0; i < n; i++) {
        if (sum % chosen[i] == 0) {
            if (printed) cout << ' ';
            cout << chosen[i];
            printed = true;
        }
    }
    if (!printed) cout << -1;
    cout << '\n';
    return 0;
}

#include <bits/stdc++.h>
using namespace std;

int main() {
    int n, m;
    cin >> n >> m;
    vector<vector<int>> a(n, vector<int>(m));   // n 列 m 行的表格
    for (int i = 0; i < n; i++)
        for (int j = 0; j < m; j++)
            cin >> a[i][j];

    vector<int> chosen(n);   // 每一列選出來的數字
    int sum = 0;
    for (int i = 0; i < n; i++) {
        int best = a[i][0];
        for (int j = 1; j < m; j++)          // 掃過第 i 列的每一格
            best = max(best, a[i][j]);
        chosen[i] = best;
        sum += best;
    }

    cout << sum << '\n';
    bool printed = false;
    for (int i = 0; i < n; i++) {
        if (sum % chosen[i] == 0) {
            if (printed) cout << ' ';
            cout << chosen[i];
            printed = true;
        }
    }
    if (!printed) cout << -1;
    cout << '\n';
    return 0;
}