#include <sys/time.h>
#include <map>
#include <unordered_map>
#include <vector>
#include <algorithm>
#include <sstream>
#include <iostream>
#include <cstdio>
using namespace std;

class Solution {
public:
  vector<int> successfulPairs(vector<int>& spells, vector<int>& potions, long long success);
};

vector<int> Solution::successfulPairs(vector<int>& sp, vector<int>& po, long long success)
{
  vector <int> rv;
  return rv;
}

int main(int argc, char **argv)
{
  struct timeval t1, t2;
  double d1, d2;
  vector <int> rv;

  int i;
  int seed;
  istringstream ss;
  string l;
  Solution s;
  long long success;
  vector <int> sp;
  vector <int> po;

  getline(cin, l);

  seed = atoi(l.c_str());

  if (seed < 0) {
    srand48(-seed);
    sp.resize((int) (drand48()*100000)+1);
    po.resize((int) (drand48()*100000)+1);
    for (i = 0; i < sp.size(); i++) sp[i] = drand48() * 100000 + 1;
    for (i = 0; i < po.size(); i++) po[i] = drand48() * 100000 + 1;
    success = sp[0];
    success *= po[0];

  } else {

    ss.clear();
    ss.str(l);
    while (ss >> i) sp.push_back(i);
    
    getline(cin, l);
    ss.clear();
    ss.str(l);
    while (ss >> i) po.push_back(i);
    
    cin >> success;
  }

  gettimeofday(&t1, NULL);
  d1 = t1.tv_usec;
  d1 /= 1000000.0;
  d1 += t1.tv_sec;

  rv = s.successfulPairs(sp, po, success);

  gettimeofday(&t2, NULL);
  d2 = t2.tv_usec;
  d2 /= 1000000.0;
  d2 += t2.tv_sec;

  if (seed >= 0) {
    for (i = 0; i < rv.size(); i++) printf("%d ", rv[i]);
    printf("\n");
  } else {
    printf("rv[%d] = %d\n", (int) (rv.size())-1, rv[rv.size()-1]);
  }

  if (argc != 1) printf("Time: %.3lf\n", d2-d1);

  return 0;
}