Arrays.stream(apple)
    .filter(x -> x + a  >= s && x + a <= t)
    .count();

Arrays.stream(orange)
    .filter(x -> x + b  >= s && x + b <= t)
    .count();

import sys

def countHits(lHouse, rHouse, treeLoc):
    lDist = lHouse - treeLoc
    rDist = rHouse - treeLoc
    return sum(1 for spot in input().strip().split(' ') if hitHouse(int(spot), lDist, rDist))

def hitHouse(spot, lDist, rDist):
    if spot >= lDist and spot <= rDist:
        return True

lHouse, rHouse = [int(x) for x in input().strip().split(' ')]
aTree, oTree = [int(x) for x in input().strip().split(' ')]
aCount, oCount = [int(x) for x in input().strip().split(' ')]

print (countHits(lHouse, rHouse, aTree))
print (countHits(lHouse, rHouse, oTree))

print(sum([1 for each in apple if s <= (each + a) <=t]))
print(sum([1 for each in orange if s <= (each + b) <=t]))

print(apples.filter{$0 + a >= s && $0 + a <= t}.count)
print(oranges.filter{$0 + b >= s && $0 + b <= t}.count)

apple = list(filter(lambda x: s-a <= x <= t-a, map(int, input().split())))
orange = list(filter(lambda x: s-b <= x <= t-b, map(int, input().split())))

[print(x) for x in map(len, [apple, orange])]

print(len([1 for app in apple if app >= s-a and app <= t-a]))
print(len([1 for ora in orange if ora <= t-b and ora >= s-b]))

app_cnt = 0
org_cnt = 0

for ap in apple:
    if ap > 0:
        if t >= a+ap >= s:
            app_cnt += 1
for og in orange:
    if og < 0:
        if t >= b+og >= s:
            org_cnt += 1

print(app_cnt)
print(org_cnt)

print(len([x for x in apple if x>0 and a+x>=s and a+x<=t]))
print(len([y for y in orange if y<0 and b+y<=t and b+y>=s]))

c = list(filter(lambda x: x==True, map(lambda x: a+x in range(s,t+1),apples)))
d = list(filter(lambda x: x==True, map(lambda x: b+x in range(s,t+1),oranges)))
print(str(len(c))+"\n"+str(len(d)))

print(sum((a + i) in range(s, t+1) for i in appleDistance))
print(sum((b + i) in range(s, t+1) for i in orangeDistance))

apples = map(lambda x: 1 if s <= a+x <= t else 0, apples)
oranges = map(lambda x: 1 if s <= b+x <= t else 0, oranges)
print(sum(apples), sum(oranges))

int applePosition = a + scan.nextInt();
            if (applePosition >= s && applePosition <= t)

public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int s = in.nextInt();
        int t = in.nextInt();
        int a = in.nextInt();
        int b = in.nextInt();
        int m = in.nextInt();
        int n = in.nextInt();
        int[] datas = {s,t,a,b,m,n};
        int apples = 0, oranges = 0;
        
        for(int data:datas){
            if( (data <=1) && (data >= Math.pow(10,5)) ){
                System.err.println("Data out of range.");
                System.exit(-1);
            }
        }
        
        if( (a > s) && (s > t) && (t > b )){
            System.err.println("the data does not meet the requirements.");
            System.exit(-1);
        }
        
        int[] apple = new int[m];
        for(int apple_i=0; apple_i < m; apple_i++){
            apple[apple_i] = in.nextInt();
            
            if( apple[apple_i] >= Math.pow(-10,5) && apple[apple_i] <= Math.pow(10,5)){
                if( ( (a + apple[apple_i]) >= s) && ( (a + apple[apple_i]) <= t) )
                apples++;
            }
            else{
                System.err.println("Apple: Distance out of the range."+apple[apple_i]);
                System.exit(-1);
            }
        }
        int[] orange = new int[n];
        for(int orange_i=0; orange_i < n; orange_i++){
            orange[orange_i] = in.nextInt();
            
            if( orange[orange_i] >= Math.pow(-10,5) && orange[orange_i] <= Math.pow(10,5)){
                if( ( (b + orange[orange_i]) >= s) && ( (b + orange[orange_i]) <= t) )
                oranges++;
            }
            else{
                System.err.println("Orange: Distance out of the range."+orange[orange_i]);
                System.exit(-1);
            }
        }
        System.out.println(apples);
        System.out.println(oranges);
    }

//header files bla bla

int main() {
    unsigned int s, t, a, b, m, n;
    cin>>s>>t;
    long long int house = (t-s);
    cin>>a>>b;
    cin>>m>>n;
    long long int d;
    long long int i,j;
    int count=0, count1=0;
    for (i=0;i<m;i++)
    {
        cin>>d;
        long long int x=(a+d);
        if (x>=s&&x<=t)
            count++;
           
    }
    for(j=0;j<n;j++)
    {
        cin>>d;
        long long int y=(b-d);
        if (y>=s && y<=t)
            count1++;
    }
    cout<<count<<endl<<count1;
        
    
    
    return 0;
}

function appleAndOrange(s, t, a, b, apple, orange) {
    return [
        apple.map(p => p + a).filter(p => p >= s && p <= t).length,
        orange.map(p => p + b).filter(p => p >= s && p <= t).length
    ]
}

int main(){
    int s, t, m, n, a, b, apple = 0 , orange = 0, dist;
    scanf("%d %d %d %d %d %d", &s, &t, &a, &b, &m, &n);
    for(int i = 0; i < m; i ++) {
        scanf("%d", &dist);
        if (dist >= s - a && dist <= t - a) apple ++;
    }
    for(int i = 0; i < n; i ++) {
        scanf("%d", &dist);
        if (dist <= t - b && dist >= s - b) orange ++;
    }
    printf("%d\n%d", apple, orange);
    return 0;
}

#include <stdio.h>
#include <stdlib.h>

int fruit_counter(int house0, int house1, int three, int* fruit, int num_fruits){
    int fruit_loc, count = 0;
    for(int i = 0; i < num_fruits; ++i){
        fruit_loc = three+fruit[i];
        if(fruit_loc >= house0 && fruit_loc <= house1){
            ++count;
        }
    }
    return count;
}

int main(){
    int s, t, a, b, m ,n;
    int apple_count, orange_count;

    scanf("%d %d",&s,&t);
    scanf("%d %d",&a,&b);
    scanf("%d %d",&m,&n);

    int* apple = malloc(m*sizeof(int));
    for(int i = 0; i < m; ++i){
       scanf("%d",&apple[i]);
    }
    int *orange = malloc(n*sizeof(int));
    for(int i = 0; i < n; ++i){
       scanf("%d",&orange[i]);
    }
    
    apple_count = fruit_counter(s, t, a, apple, m);
    orange_count = fruit_counter(s, t, b, orange, n);
    
    printf("%d\n%d\n", apple_count, orange_count);
    
    return 0;
}