#include<bits/stdc++.h>
#define int long long
#define PII pair<int,int>
#define endl "\n"
using namespace std;
const int N=1e6+5;
const int INF=0x3f3f3f3f;
const double EPS=1e-6;
const int MOD=1e9+7;
int n,a[N],k,sum[N];
set<int>g;
void solve(){
	cin>>n;
	for(int i=1;i<=n;i++)cin>>a[i],sum[i]=sum[i-1]+a[i];
	cin>>k;
	for(int i=1;i<=n&&sum[i]<=k;i++){
		int x=lower_bound(sum+1,sum+n+1,sum[i]*2)-sum;
		for(int j=sum[i];j<=k&&(x==n?1:j<sum[x]-sum[i]);j++)g.insert(j);
	}
	cout<<g.size()<<endl;
	for(auto x:g)cout<<x<<" ";
}
signed main(){
	ios::sync_with_stdio(0);
	cin.tie(0),cout.tie(0);
	int T=1;
//	cin>>T;
	while(T--)solve();
	return 0;
}

64分球条