#include<algorithm>
#include<bitset>
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<deque>
#include<fstream>
#include<iostream>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<utility>
#include<vector>

using namespace std;

typedef long long int lld;
typedef pair<int,int> PII;

const int INF = (1<<31)-1;
const lld LINF = (1LL<<63)-1;

const int NMAX = 100000+5;
const int MMAX = 100000+5;
const int KMAX = 100000+5;
const int PMAX = 100000+5;
const int LMAX = 100000+5;
const int VMAX = 100000+5;

bool cmp(PII a,PII b)
{
    return a.second<b.second;
}

int N,M;
PII A[1005];
int B[1005];
int C[1005];

int main()
{
    int i,j=0,k,Sol=0,x;

    scanf("%d%d",&N,&M);

    for(i=1; i<=N; i++)
    {
        scanf("%d",&x);
        A[i]=make_pair(x,i);
    }

    sort(A+1,A+N+1);

    for(i=1; i<=M; i++)
        scanf("%d",&C[i]);
    sort(C+1,C+M+1);
    for(i=1; i<=M-1; i++)
    {
        if(C[i]==C[i+1]) continue;
        B[++j]=C[i];
    }
    M=j;

    for(i=1; i<=N; i++)
    {
        for(j=i; A[i].first==A[j].first; j++);
        for(j--,k=0; j>=i; j--,k++)
            A[j].first-=B[k];
    }

    sort(A+1,A+N+1);

    Sol=N;

    for(i=1; i<=N; i++)
        if(A[i].first==A[i+1].first) Sol--;

    sort(A+1,A+N+1,cmp);

    printf("%d\n",Sol);

    for(i=1; i<=N; i++)
        printf("%d ",A[i].first);

    return 0;
}