from typing import Tuple

def f(nums: Tuple) -> int:
    return nums.index(min(filter(lambda x : x > 0, nums)))

if __name__ == '__main__':
    m, n = map(int, input().split())
    a = tuple(map(int, input().split()))
    b = tuple(map(int, input().split()))
    print(f(a), f(b))

#include <iostream>
using namespace std;

void Input(int n1,int a[]);
void Output(int n1,int n2,int a[],int b[]);
int search(int a[],int k,int n);
int findmincount(int a[],int n1);

int main()
{
    int n1,n2;
    cin>>n1>>n2;
    int a[n1],b[n2];
    Input(n1,a);
    Input(n2,b);
    Output(n1,n2,a,b);
    return 0;
}

void Input(int n1,int a[])
{
    for(int i=0;i<n1;i++) cin>>a[i];    
}

void Output(int n1,int n2,int a[],int b[])
{
    int x1=findmincount(a,n1);
    int x2=findmincount(b,n2);
    cout<<x1<<" "<<x2<<endl;
}

int search(int a[],int k,int n)
{
    int i;
    for(i=0;i<n;i++)
        if(a[i]==k) break;
    return i;
}

int findmincount(int a[],int n1)
{
    int min,i;
    for(i=0;i<n1;i++)
        if(a[i]>0) break;
    min=a[i];
    for(i=0;i<n1;i++)
        if(a[i]<min&&a[i]>0) min=a[i]; 
    return search(a,min,n1);
}

#include<iostream>
using namespace std;

class Array
{
private:
    int *a;
    int n;
public:
    Array(int n)
    {
        this->n=n;
        a=new int[n*2];
        for(int i=0;i<n;i++)
            cin>>a[i];
    }

    void output()
    {
        for(int i=0;i<n;i++)
            cout<<a[i]<<" ";
        cout<<endl;
    }

    int find_min()
    {
        int flag=0;
        while(a[flag]<=0)
            flag++;
        if(flag==n)//没有正数
            return -1;
        if(flag==n-1)
            return flag;
        for(int i=flag+1;i<n;i++)
            if(a[i]<a[flag] && a[i]>0)
                flag=i;
        return flag;
    }
};
            
int main()
{
    int n1,n2;
    cin>>n1>>n2;
    Array arr1(n1);
    Array arr2(n2);

    cout<<arr1.find_min()<<" "<<arr2.find_min()<<endl;
    
    system("pause");
    return 0;
}

#include<iostream>
using namespace std;
class minf{
    public:
        int mf(int a[],int n){
            int imin=0;
            while(a[imin]<=0) imin++; 
            for(int i=1;i<n;i++){
                if(a[i]<=0) continue;
                if(a[i]<a[imin])
                    imin=i;
            }
            return imin;
        }
    private:
}k;
int main()
{
    int na,nb;scanf("%d%d",&na,&nb);
    int a[na];
    int b[nb];
    for(int i=0;i<na;i++) scanf("%d",&a[i]);
    for(int i=0;i<nb;i++) scanf("%d",&b[i]);
    int mina=k.mf(a,na);
    int minb=k.mf(b,nb);
    cout<<mina<<" "<<minb;
    return 0;
}