#include<iostream>
#include<cstdio>
#include<algorithm>
#include<string.h>
#include<queue>
#include<vector>
#include<map>
#include<bitset>
#include<set>
#include<cmath>
#include<ctime>
#include<random>
#define vi vector<int>
#define pb push_back
#define fi first
#define se second
#define mp make_pair
#define bc(x) __builtin_popcount(x)
#define re register
#define il inline
#define pii pair<int,int>
#define pil pair<int,long long>
#define pll pair<long long,long long>
#define mem0(x) memset(x,0,sizeof(x))
#define mem0x3f(x) memset(x,0x3f,sizeof(x))
#define dbg(x) cerr<<"In Line "<< __LINE__<<" the "<<#x<<" = "<<x<<'\n';
// #pragma GCC optimize(3)
#define int long long
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
namespace IO_BUFF{
	mt19937 rnd(time(0)^(ll)(new char));
	int rend(int x){
		return rnd()%x+1;
	}
	void rendom_shuffle(int *a,int len){
		shuffle(a+1,a+len+1,rnd);
	}
	const int BS=(1<<24)+5;char Buffer[BS],*HD,*TL;
	inline int gc(){
	    if(HD==TL) TL=(HD=Buffer)+fread(Buffer,1,BS,stdin);
	    return (HD==TL)?EOF:*HD++;
	}
	inline int inn(){
	    int x,ch,s=1;while((ch=gc())<'0'||ch>'9')if(ch=='-')s=-1;x=ch^'0';
	    while((ch=gc())>='0'&&ch<='9') x=(x<<1)+(x<<3)+(ch^'0');return x*s;
	}
	char ssss[19999999],tttt[20];int ssl,ttl;
    inline int print(int x)
    {
        if(x<0)ssss[++ssl]='-',x=(-x);
		if(!x) ssss[++ssl]='0';for(ttl=0;x;x/=10) tttt[++ttl]=char(x%10+'0');
        for(;ttl;ttl--) ssss[++ssl]=tttt[ttl];return ssss[++ssl]='\n';
    }
	inline int Flush(){return fwrite(ssss+1,sizeof(char),ssl,stdout),ssl=0,0;}
	int read(){
		char c=getchar();int x=1;int s=0;
		while(c<'0' || c>'9'){if(c=='-')x=-1;c=getchar();}
		while(c>='0' && c<='9'){
			s=s*10+c-'0';c=getchar();
		}
		return s*x;
	}
}using namespace IO_BUFF;
/*namespace CFConTest{
	const int mod=998244353;
	inline int add(const int &x,const int &y){
		return (x+y>=mod?x+y-mod:x+y);
	}
	inline int del(const int &x,const int &y){
		return (x-y<0?x-y+mod:x-y);
	}
	int ksm(int x,int k){
		int base=1;
		while(k){
			if(k&1)base=1ll*base*x%mod;
			k>>=1;
			x=1ll*x*x%mod;
		}
		return base;
	}
};
using namespace CFConTest;*/
const int N=3050;
const int mod=59393;
int n,m,a[N],h[N];
int f[N][N],g[N]; // in i have chose k
int s[N],c[N];
int st[N],top;
vector<pii> pruefer_decode(vector<int> const& code) {
  //int n = code.size() + 2;
  vector<int> degree(n, 1);
  for (int i : code) degree[i]++;

  set<int> leaves;
  for (int i = 0; i < n; i++)
    if (degree[i] == 1) leaves.insert(i);

  vector<pair<int, int>> edges;
  for (int v : code) {
    int leaf = *leaves.begin();
    leaves.erase(leaves.begin());

    edges.emplace_back(leaf, v);
    if (--degree[v] == 1) leaves.insert(v);
  }
  edges.emplace_back(*leaves.begin(), n - 1);
  return edges;
}
signed main(){
	#ifdef newbiewzs
		freopen("data.in","r",stdin);
	//	freopen("std.out","w",stdout);
	#else
	#endif
	n=read();m=read();
	
//	n=3000;m=0;
	for(int i=0;i<=m;i++){
		a[i]=read();
	}
	for(int i=0;i<=n;i++){
		int pre=1;
		for(int k=0;k<=m;k++){
			h[i]=(h[i]+a[k]*pre)%mod;
			pre=pre*i%mod;
		}
	}
	if(n==1){
		cout<<0<<" "<<h[0]<<'\n';
		return 0;
	}
	if(n==2){
		cout<<1<<" "<<2*h[1]<<'\n';
		cout<<1<<" "<<2;
		return 0;
	}
	memset(f,-10,sizeof(f));
	//f[0][1]=0;
	f[1][1]=h[2]-h[1];
	for(int i=1;i<=n-2;i++){
		for(int j=1;j<=i-1;j++){
			if(f[i-1][j]+h[2]-h[1]>f[i][1]){
				g[i]=j;
			}
			f[i][1]=max(f[i][1],f[i-1][j]+h[2]-h[1]);
		}
		for(int k=1;k<=i;k++){
			if(k>1)f[i][k]=max(f[i][k],f[i-1][k-1]+h[k+1]-h[k]);
		}
	}
	int ans=-1e9;
	int las=0;
	for(int i=1;i<=n-2;i++){
		if(f[n-2][i]>ans){
			las=i;
		}
		ans=max(ans,f[n-2][i]);
	}
	ans+=h[1]*n;
	cout<<n-1<<" "<<ans<<'\n';
//	return 0;
	int u=n-2;
	while(1){
		u=u-las+1;
		st[++top]=las;
		las=g[u];
		u--;
		if(!las)break;
	}
	vi tmp;
	for(int i=1;i<=top;i++){
		for(int k=1;k<=st[i];k++)tmp.pb(i-1);
	}
	auto kel=pruefer_decode(tmp);
	for(auto k:kel){
		cout<<k.fi+1<<" "<<k.se+1<<'\n';
	}
	return 0;
}