DSA02013 - SỐ NGUYÊN TỐ

//Made By Phuong Nam PROPTIT <3//
#pragma GCC Optimize("O3")
#include<bits/stdc++.h>
#include<string>
#include<vector>
#define alphaa "abcdefghijklmnopqrstuvwxyz"
#define ALPHAA "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
#define f(i,a,b) for(int i=a;i<=b;i++)
#define f1(i,n) for(int i=1;i<=n;i++)
#define f0(i,n) for(int i=0;i<n;i++)
#define ff(i,b,a) for(int i=b;i>=a;i--)
#define el cout<<'\n'
#define fi first
#define se second
#define pb push_back
#define pk pop_back
#define vi vector<int>
#define vl vector<ll>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define all(s) s.begin(),s.end()
using namespace std;
typedef long long ll;
const int N=1e3+3;
const int MOD=1e9+7;
template<class X,class Y>
    void minimize(X &x,const Y &y) {
        if (x>y) x=y;
    }
template<class X,class Y>
    void maximize(X &x,const Y &y) {
        if (x<y) x=y;
    }
template<class T>
    T Abs(const T &x) {
        return (x<0?-x:x);
    }
int n,p,s;
bool c[255];
vi v,t;
vector<vi>res;
void sang()
{
   c[0]=c[1]=1;
   for(int i=2;i*i<=210;i++)
   {
       if(!c[i])
       {
           for(int j=i*i;j<=210;j+=i) c[j]=1;
       }
   }
   f1(i,210)
   {
       if(!c[i]) v.pb(i);
   }
}
void quay(int i,int dem,int sum,vi t)
{
    if(dem>n) return;
    if(sum>s) return;
    if(dem==n)
    {
        if(sum==s)
        {
            res.pb(t);
            return;
        }
    }
    for(int j=i;j<v.size();j++)
    {
        if(sum+v[j]<=s)
        {
            t.pb(v[j]);
            quay(j+1,dem+1,sum+v[j],t);
            t.pk();
        }
    }
}
void xuly()
{
   res.clear();
   cin>>n>>p>>s;
   int i=upper_bound(all(v),p)-v.begin();
   quay(i,0,0,t);
   cout<<res.size()<<'\n';
   sort(all(res));
   f0(k,res.size())
   {
       for(auto j:res[k]) cout<<j<<' ';
       el;
   }
}
int main()
{
  ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
  sang();
  int t=1;
  cin>>t;
  while(t--) xuly();
  return 0;
}
//-----YEU CODE HON CRUSH-----//