#pragma GCC optimize(3, "unroll-loops", "no-stack-protector")
#define atsum(l, r) accumulate(l, r, 0)
#include <bits/stdc++.h>

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/hash_policy.hpp>
using namespace std;
using ll = long long;
using ull = unsigned long long;
constexpr int inf = 0x3f3f3f3f;
constexpr ll INF = 0x3f3f3f3f3f3f3f3f;
template <typename T>
inline void chkmin(T &x, T y) {
    x = min(x, y);
}
template <typename T>
inline void chkmax(T &x, T y) {
    x = max(x, y);
}
namespace FastIO {
// ------------------------------
#define IN_HAS_NEG
#define OUT_HAS_NEG
#define CHK_EOF
#define DISABLE_MMAP
// ------------------------------
#if __cplusplus < 201400
#error Please use C++14 or higher.
#endif
#if __cplusplus > 201700
#define INLINE_V inline
#else
#define INLINE_V
#endif
#if (defined(LOCAL) || defined(_WIN32)) && !defined(DISABLE_MMAP)
#define DISABLE_MMAP
#endif
#ifndef DISABLE_MMAP
#include <sys/mman.h>
#endif
#ifdef LOCAL
inline char gc() { return getchar(); }
inline void pc(char c) { putchar(c); }
#else
#ifdef DISABLE_MMAP
INLINE_V constexpr int _READ_SIZE = 1 << 18;
INLINE_V static char _read_buffer[_READ_SIZE], *_read_ptr = nullptr,
                                               *_read_ptr_end = nullptr;
inline char gc() {
    if (__builtin_expect(_read_ptr == _read_ptr_end, false)) {
        _read_ptr = _read_buffer;
        _read_ptr_end =
            _read_buffer + fread(_read_buffer, 1, _READ_SIZE, stdin);
#ifdef CHK_EOF
        if (__builtin_expect(_read_ptr == _read_ptr_end, false)) return EOF;
#endif
    }
    return *_read_ptr++;
}
#else
INLINE_V static const char *_read_ptr =
    (const char *)mmap(nullptr, INT_MAX, 1, 2, 0, 0);
inline char gc() { return *_read_ptr++; }
#endif
INLINE_V constexpr int _WRITE_SIZE = 1 << 18;
INLINE_V static char _write_buffer[_WRITE_SIZE], *_write_ptr = _write_buffer;
inline void pc(char c) {
    *_write_ptr++ = c;
    if (__builtin_expect(_write_buffer + _WRITE_SIZE == _write_ptr, false)) {
        fwrite(_write_buffer, 1, _write_ptr - _write_buffer, stdout);
        _write_ptr = _write_buffer;
    }
}
INLINE_V struct _auto_flush {
    ~_auto_flush() {
        fwrite(_write_buffer, 1, _write_ptr - _write_buffer, stdout);
    }
} _auto_flush;
#endif
#ifdef CHK_EOF
inline bool _isdigit(char c) { return (c & 16) && c != EOF; }
inline bool _isgraph(char c) { return c > 32 && c != EOF; }
#else
inline bool _isdigit(char c) { return c & 16; }
inline bool _isgraph(char c) { return c > 32; }
#endif
template <class T>
INLINE_V constexpr bool _is_integer = numeric_limits<T>::is_integer;
template <class T>
INLINE_V constexpr bool _is_signed = numeric_limits<T>::is_signed;
template <class T>
INLINE_V constexpr bool _is_unsigned = _is_integer<T> && !_is_signed<T>;
template <>
INLINE_V constexpr bool _is_integer<__int128> = true;
template <>
INLINE_V constexpr bool _is_integer<__uint128_t> = true;
template <>
INLINE_V constexpr bool _is_signed<__int128> = true;
template <>
INLINE_V constexpr bool _is_unsigned<__uint128_t> = true;
#undef INLINE_V
inline void read(char &c) {
    do c = gc();
    while (!_isgraph(c));
}
inline void read_cstr(char *s) {
    char c = gc();
    while (!_isgraph(c)) c = gc();
    while (_isgraph(c)) *s++ = c, c = gc();
    *s = 0;
}
inline void read(string &s) {
    char c = gc();
    s.clear();
    while (!_isgraph(c)) c = gc();
    while (_isgraph(c)) s.push_back(c), c = gc();
}
#ifdef IN_HAS_NEG
template <class T, enable_if_t<_is_signed<T>, int> = 0>
inline void read(T &x) {
    char c = gc();
    bool f = true;
    x = 0;
    while (!_isdigit(c)) {
        if (c == 45) f = false;
        c = gc();
    }
    if (f)
        while (_isdigit(c)) x = x * 10 + (c & 15), c = gc();
    else
        while (_isdigit(c)) x = x * 10 - (c & 15), c = gc();
}
template <class T, enable_if_t<_is_unsigned<T>, int> = 0>
#else
template <class T, enable_if_t<_is_integer<T>, int> = 0>
#endif
inline void read(T &x) {
    char c = gc();
    while (!_isdigit(c)) c = gc();
    x = 0;
    while (_isdigit(c)) x = x * 10 + (c & 15), c = gc();
}
inline void write(char c) { pc(c); }
inline void write_cstr(const char *s) {
    while (*s) pc(*s++);
}
inline void write(const string &s) {
    for (char c : s) pc(c);
}
#ifdef OUT_HAS_NEG
template <class T, enable_if_t<_is_signed<T>, int> = 0>
inline void write(T x) {
    char buffer[numeric_limits<T>::digits10 + 1];
    int digits = 0;
    if (x >= 0) do
            buffer[digits++] = (x % 10) | 48, x /= 10;
        while (x);
    else {
        pc(45);
        do buffer[digits++] = -(x % 10) | 48, x /= 10;
        while (x);
    }
    while (digits) pc(buffer[--digits]);
}
template <class T, enable_if_t<_is_unsigned<T>, int> = 0>
#else
template <class T, enable_if_t<_is_integer<T>, int> = 0>
#endif
inline void write(T x) {
    char buffer[numeric_limits<T>::digits10 + 1];
    int digits = 0;
    do buffer[digits++] = (x % 10) | 48, x /= 10;
    while (x);
    while (digits) pc(buffer[--digits]);
}
template <int N>
struct _tuple_io_helper {
    template <class... T>
    static inline void _read(tuple<T...> &x) {
        _tuple_io_helper<N - 1>::_read(x), read(get<N - 1>(x));
    }
    template <class... T>
    static inline void _write(const tuple<T...> &x) {
        _tuple_io_helper<N - 1>::_write(x), pc(32), write(get<N - 1>(x));
    }
};
template <>
struct _tuple_io_helper<1> {
    template <class... T>
    static inline void _read(tuple<T...> &x) {
        read(get<0>(x));
    }
    template <class... T>
    static inline void _write(const tuple<T...> &x) {
        write(get<0>(x));
    }
};
template <class... T>
inline void read(tuple<T...> &x) {
    _tuple_io_helper<sizeof...(T)>::_read(x);
}
template <class... T>
inline void write(const tuple<T...> &x) {
    _tuple_io_helper<sizeof...(T)>::_write(x);
}
template <class T1, class T2>
inline void read(pair<T1, T2> &x) {
    read(x.first), read(x.second);
}
template <class T1, class T2>
inline void write(const pair<T1, T2> &x) {
    write(x.first), pc(32), write(x.second);
}
template <class T1, class... T2>
inline void read(T1 &x, T2 &...y) {
    read(x), read(y...);
}
template <class... T>
inline void read_cstr(char *x, T *...y) {
    read_cstr(x), read_cstr(y...);
}
template <class T1, class... T2>
inline void write(const T1 &x, const T2 &...y) {
    write(x), write(y...);
}
template <class... T>
inline void write_cstr(const char *x, const T *...y) {
    write_cstr(x), write_cstr(y...);
}
template <class T>
inline void print(const T &x) {
    write(x);
}
inline void print_cstr(const char *x) { write_cstr(x); }
template <class T1, class... T2>
inline void print(const T1 &x, const T2 &...y) {
    print(x), pc(32), print(y...);
}
template <class... T>
inline void print_cstr(const char *x, const T *...y) {
    print_cstr(x), pc(32), print_cstr(y...);
}
inline void println() { pc(10); }
inline void println_cstr() { pc(10); }
template <class... T>
inline void println(const T &...x) {
    print(x...), pc(10);
}
template <class... T>
inline void println_cstr(const T *...x) {
    print_cstr(x...), pc(10);
}
}  // namespace FastIO
using namespace FastIO;
template <typename T>
inline void clear(T &x) {
    T y;
    swap(x, y);
}
template < class U, class V, class H = hash < U > > class hash_table
{
    constexpr static int L = 23, N = 1 << L;
    int p[N], c; bitset < N > o; U u[N]; V v[N];
    inline int h(const U &x)const
    {
        static const unsigned long long d = chrono::system_clock::now().time_since_epoch().count();
        int i = ( ( H()(x) + d ) * 11995408973635179863ull ) >> ( 64 - L );
        while ( o.test(i) && x != u[i] ) ++i &= N - 1; return i;
    }
public:
    inline int size()const { return c; }
    inline bool empty()const { return !c; }
    inline void clear() { if ( c < ( N >> 7 ) ) while ( c ) o.reset(p[--c]); else c = 0, o.reset(); }
    inline bool count(const U &x)const { return o.test(h(x)); }
    inline V get(const U &x, const V &y = V{})const { int i = h(x); return o.test(i) ? v[i] : y; }
    inline V &operator[](const U &x)
    {
        int i = h(x); if ( o.test(i) ) return v[i];
        return o.set(i), p[c++] = i, u[i] = x, v[i] = V{0, 0};
    }
};
hash_table<int, pair<int, int> > f;
inline void upd(pair<int, int> &a, pair<int, int> b) {
    if (a.first > b.first) return;
    if (a.first == b.first) {
        if ((a.second += b.second) >= 1000000007) a.second -= 1000000007;
        return;
    }
    a = b;
}
queue<int> q;
int d[12], n, m, t;
int mask[31][31], mask2[31][31][31];
int swap_count;
vector<int> A;
inline void work(int &S, int &pos) {
    int pS = S;
    for (int i = 0; i < t; i++) {
        // cerr << "find qwq:" << S << ' ' << pos << ' ' << mask[t][i] << ' ' << endl;
        if (pos % t == i) swap_count += __builtin_popcount((mask[t][i] & ~S) >> pos + 1);
        // bubble_sort(mask[t][i] & S);
        int c = mask[t][i] & S;
        S &= ~mask[t][i];
        S |= mask2[t][i][__builtin_popcount(c)];
        if (pos % t == i) {
            // cerr << "find c:" << c << ' ' << pos << ' ' << mask[t][i] << ' ' << t << ' ' << i << endl;
            pos = __builtin_ctz(mask2[t][i][__builtin_popcount(c)]);
        }
    }
    // assert(__builtin_popcount(S) == __builtin_popcount(pS));
}
inline void shell_sort(int S, int pos) {
    assert(S >> pos & 1);
    swap_count = 0;
    for (int i = 1; i <= m; i++) {
        t = d[i];
        work(S, pos);
    }
}

int main() {
    read(n, m);
    for (int i = 0; i <= n; i++)
        for (int j = 0; j < i; j++) {
            for (int k = 0; k < n; k++)
                if (k % i == j) mask[i][j] |= 1 << k;
        }
    for (int i = 0; i <= n; i++)
        for (int j = 0; j < i; j++) {
            for (int k = 0; k <= __builtin_popcount(mask[i][j]); k++) {
                int t = k;
                for (int c = n - 1; ~c; c--)
                    if (c % i == j && t) mask2[i][j][k] |= 1 << c, t--; 
            }
        }
    for (int i = 1; i <= m; i++) read(d[i]);
    f[0] = {1, 1}, q.push(0);
    A.resize(n);
    int cc = 0;
    while (q.size()) {
        int u = q.front();
        q.pop();
        // cerr << "find u:" << u << endl;
        ++cc;
        for (int i = 0; i < n; i++)
            if ((i + d[1] >= n || ((u >> i + d[1]) & 1)) && (u >> i & 1 ^ 1)) {
                shell_sort((~u & ((1 << n) - 1)) | (1 << i), i);
                if (!f.count(u | 1 << i)) q.push(u | 1 << i);
                upd(f[u | 1 << i], make_pair(f[u].first + swap_count, f[u].second));
            }
    }
    println(f[(1 << n) - 1].first - 1, f[(1 << n) - 1].second);
    return 0;
}
/*
30 10
10 9 8 7 6 5 4 3 2 1
*/