#include <bits/stdc++.h>
using namespace std;

int main(){
    int n, m;
    scanf("%d%d", &n, &m);
    long long sumA = 0;
    for(int i = 0; i < n; i++){
        long long x; scanf("%lld", &x);
        sumA += x;
    }
    vector<long long> b(m);
    for(int i = 0; i < m; i++) scanf("%lld", &b[i]);

    vector<long long> pre(m+1, 0);
    for(int i = 0; i < m; i++) pre[i+1] = pre[i] + b[i];

    long long bestDiff = LLONG_MAX;
    int bestL = 0, bestR = 0;

    for(int i = 0; i < m; i++){
        long long target = sumA + pre[i];
        int lo = i+1, hi = m;
        int left = lo, right = hi;
        while(left <= right){
            int mid = (left + right) / 2;
            if(pre[mid] >= target) right = mid - 1;
            else left = mid + 1;
        }
        for(int c = max(lo, left-1); c <= min(hi, left); c++){
            long long diff = abs(pre[c] - target);
            if(diff < bestDiff || (diff == bestDiff && i < bestL)){
                bestDiff = diff;
                bestL = i;
                bestR = c - 1;
            }
        }
    }

    for(int i = bestL; i <= bestR; i++){
        if(i > bestL) printf(" ");
        printf("%lld", b[i]);
    }
    printf("\n");
    return 0;
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt(), m = sc.nextInt();
        long sumA = 0;
        for (int i = 0; i < n; i++) sumA += sc.nextLong();
        long[] b = new long[m];
        for (int i = 0; i < m; i++) b[i] = sc.nextLong();

        long[] pre = new long[m + 1];
        for (int i = 0; i < m; i++) pre[i + 1] = pre[i] + b[i];

        long bestDiff = Long.MAX_VALUE;
        int bestL = 0, bestR = 0;

        for (int i = 0; i < m; i++) {
            long target = sumA + pre[i];
            int lo = i + 1, hi = m;
            int left = lo, right = hi;
            while (left <= right) {
                int mid = (left + right) / 2;
                if (pre[mid] >= target) right = mid - 1;
                else left = mid + 1;
            }
            for (int c = Math.max(lo, left - 1); c <= Math.min(hi, left); c++) {
                long diff = Math.abs(pre[c] - target);
                if (diff < bestDiff || (diff == bestDiff && i < bestL)) {
                    bestDiff = diff;
                    bestL = i;
                    bestR = c - 1;
                }
            }
        }

        StringBuilder sb = new StringBuilder();
        for (int i = bestL; i <= bestR; i++) {
            if (i > bestL) sb.append(' ');
            sb.append(b[i]);
        }
        System.out.println(sb.toString());
    }
}

import bisect, sys
input = sys.stdin.readline

def main():
    n, m = map(int, input().split())
    a = list(map(int, input().split()))
    b = list(map(int, input().split()))

    sumA = sum(a)

    pre = [0] * (m + 1)
    for i in range(m):
        pre[i + 1] = pre[i] + b[i]

    best_diff = float('inf')
    best_l = 0
    best_r = 0

    for i in range(m):
        target = sumA + pre[i]
        lo = i + 1
        pos = bisect.bisect_left(pre, target, lo, m + 1)
        for c in range(max(lo, pos - 1), min(m, pos) + 1):
            diff = abs(pre[c] - target)
            if diff < best_diff or (diff == best_diff and i < best_l):
                best_diff = diff
                best_l = i
                best_r = c - 1

    print(' '.join(map(str, b[best_l:best_r + 1])))

main()

const readline = require('readline');
const rl = readline.createInterface({ input: process.stdin });
const lines = [];
rl.on('line', l => lines.push(l.trim()));
rl.on('close', () => {
    const [n, m] = lines[0].split(' ').map(Number);
    const a = lines[1].split(' ').map(Number);
    const b = lines[2].split(' ').map(Number);

    let sumA = 0;
    for (let i = 0; i < n; i++) sumA += a[i];

    const pre = new Array(m + 1).fill(0);
    for (let i = 0; i < m; i++) pre[i + 1] = pre[i] + b[i];

    let bestDiff = Infinity;
    let bestL = 0, bestR = 0;

    for (let i = 0; i < m; i++) {
        const target = sumA + pre[i];
        let lo = i + 1, hi = m;
        let left = lo, right = hi;
        while (left <= right) {
            const mid = (left + right) >> 1;
            if (pre[mid] >= target) right = mid - 1;
            else left = mid + 1;
        }
        for (let c = Math.max(lo, left - 1); c <= Math.min(hi, left); c++) {
            const diff = Math.abs(pre[c] - target);
            if (diff < bestDiff || (diff === bestDiff && i < bestL)) {
                bestDiff = diff;
                bestL = i;
                bestR = c - 1;
            }
        }
    }

    const res = [];
    for (let i = bestL; i <= bestR; i++) res.push(b[i]);
    console.log(res.join(' '));
});