#pragma comment(linker, "/STACK:1024000000,1024000000")

#include<cstdio>

#include<cstring>

#include<cmath>

#include<algorithm>

#include<vector>

#include<map>

#include<set>

#include<queue>

#include<stack>

#include<ctime>

#include<iostream>

using namespace std;

typedef long long LL;

const double pi=acos(-1.0),eps=1e-;

void File()

{

    freopen("D:\\in.txt","r",stdin);

    freopen("D:\\out.txt","w",stdout);

}

template <class T>

inline void read(T &x)

{

    char c = getchar();

    x = ;

    while(!isdigit(c)) c = getchar();

    while(isdigit(c))

    {

        x = x *  + c - '';

        c = getchar();

    }

}

int n,m;

int p[],s[],cnt[];

int h[],nx[];

int c,u;

int a[],b[],r[];

struct X

{

    int s,id;

    X(int S,int ID)

    {

        s=S;

        id=ID;

    }

     bool operator < (const X &a) const {

        return s>a.s;

    }

};

priority_queue<X>q;

int Z(int x)

{

    int L=,R=n,res=-;

    while(L<=R)

    {

        int mid=(L+R)/;

        if(r[mid]>x) R=mid-;

        else if(r[mid]==x) R=mid-,res=mid;

        else L=mid+;

    }

    return res;

}

int main()

{

    scanf("%d%d",&n,&m);

    for(int i=;i<=n;i++) { scanf("%d",&p[i]); r[i]=p[i]; }

    sort(r+,r++n);

    memset(h,-,sizeof h);

    for(int i=;i<=n;i++)

    {

        int pp=Z(p[i]);

        nx[i]=h[pp], h[pp]=i;

    }

    for(int i=;i<=m;i++) { scanf("%d",&s[i]); q.push(X(s[i],i)); }

    while(!q.empty())

    {

        X top = q.top(); q.pop();

        while()

        {

            int pp=Z(top.s);

            if(top.s==&&pp==-) break;

            if(top.s==&&pp!=-&&h[pp]==-) break;

            if(pp!=-&&h[pp]!=-)

            {

                c++; u=u+cnt[top.id];

                a[top.id]=cnt[top.id];

                b[h[pp]]=top.id;

                h[pp]=nx[h[pp]];

                break;

            }

            else

            {

                if(top.s%==) top.s=top.s/;

                else top.s=top.s/+;

                cnt[top.id]++;

            }

        }

    }

    printf("%d %d\n",c,u);

    for(int i=;i<=m;i++) printf("%d ",a[i]); cout<<endl;

    for(int i=;i<=n;i++) printf("%d ",b[i]); cout<<endl;

    return ;

}