#include<cstdio>
#include<iostream>
#include<cstdlib>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<vector>
#include<queue>
#define ll long long
using namespace std;
const int maxn=40010;
const int maxq=100010;
int n,q,dfn;
int x[maxq],y[maxq];
char SS[maxn];
struct Trie
{Trie *ch[27];int Size,dep,rnk;Trie *prev,*next;Trie *first,*last;Trie *father,*top;Trie(){memset(ch,0,sizeof(ch));Size=0;father=0;prev=next=first=last=0;}Trie *pre(){Trie *now;for(now=this;now->prev;now=now->prev);return now;}Trie *suf() {Trie *now;for(now=this;now->next;now=now->next);return now;}Trie *insert(int val){Trie* &now=ch[val];if (now==0){now=new Trie;now->father=this;Size++;}return now;}int count() {Trie *now=pre();int cnt=0;while(now) {++cnt;now=now->next;}return cnt;}bool find(Trie*o) {Trie *now=pre();while(now) {if(now==o)return true;now=now->next;}return false;}bool canFirst(Trie*c) {if (c==first)return true;if (first != 0 || c->prev != 0)return false;if (c->suf()==last && c->count()!=Size)return false;return true;}bool canLast(Trie*c) {if (c == last)return true;if (last!=0 || c->next!=0)return false;if (c->pre()==first && c->count()!=Size)return false;return true;}bool canNext(Trie*c1,Trie*c2) {if (c1->next==c2)return true;if (c1->next!=0 || c2->prev!=0)return false;if (c1==last || c2==first)return false;if (c1->find(c2))return false;if (c1->pre()==first && c2->suf()==last && c1->count()+c2->count()<Size)return false;return true;}void dfs(int de) {rnk=dfn++;dep=de;if(father==0) top=0; else if(father->Size>1)top=father;else top=father->top;for(int i=0;i<27;i++)if(ch[i]!=0)ch[i]->dfs(dep+1);}
};
int todolis[maxq];
Trie *es[maxn],*ed[maxn],*rt;
Trie *getLCA(Trie *a, Trie *b)
{while("woxihuan_keduoli"){if(a==b)return a;if(a==rt || b==rt)return rt;if( (a->top->dep) < (b->top->dep) )swap(a,b);a=a->top;}
}
void set(Trie *a,Trie *b)
{Trie *l=getLCA(a,b);while(a->top!=l) {Trie*fa=a->top;fa->last=a;a=fa;}while(b->top!=l) {Trie*fa=b->top;fa->first=b;b=fa;}a->next=b,b->prev=a;
}
bool check(Trie *a, Trie *b)
{Trie *l=getLCA(a, b);while(a->top!=l) {Trie*fa=a->top;if(!fa->canLast(a))return false;a=fa;}while(b->top!=l) {Trie*fa=b->top;if(!fa->canFirst(b))return false;b=fa;}if(!l->canNext(a,b))return false;return true;
}
bool cmp(Trie*a, Trie*b){return (a->rnk) < (b->rnk);}
ll ans,cnt;
int main()
{scanf("%d%d",&n,&q);rt=new Trie;for(int i=0;i<n;i++) {scanf("%s",SS);int len=strlen(SS);Trie *temp=rt;for(int j=0;j<len;j++)temp=temp->insert(SS[j]-'a'+1);temp=temp->insert(0);ed[i]=temp;}ll ans=0;rt->dfs(0);for(int i=0;i<q;i++) scanf("%d%d",&x[i],&y[i]),--x[i],--y[i];for(int i=q-1;i>=0;i--) if(check(ed[x[i]],ed[y[i]])) {set(ed[x[i]],ed[y[i]]);++cnt;todolis[i]=1;}for(int i=0;i<n;i++)es[i]=ed[i];sort(es,es+n,cmp);ll tmp;for(int i=0;i<n-1;i++){tmp=getLCA(es[i],es[i+1])->dep;ans+=tmp*tmp;}printf("%lld\n%lld\n",ans,cnt);for(int i=0;i<q;i++)if(todolis[i])printf("%d ",i+1);return 0;
}