#include <iostream>
using namespace std;
const int N = 100010;
int n, m, x;
int a[N], b[N];
int main()
{
scanf("%d%d%d", &n, &m, &x);
for (int i = 0; i < n; i ++ ) scanf("%d", &a[i]);
for (int i = 0; i < m; i ++ ) scanf("%d", &b[i]);
for (int i = 0, j = m - 1; i < n; i ++ )
{
while (j >= 0 && a[i] + b[j] > x) j -- ;
if (a[i] + b[j] == x)
{
cout << i << ' ' << j << endl;
return 0;
}
}
return 0;
}
#include <iostream>
using namespace std;
const int N = 100010;
int a[N], b[N];
int n, m, x;
int main()
{
scanf("%d%d%d", &n, &m, &x);
for (int i = 0; i < n; i ++) scanf("%d", &a[i]);
for (int i = 0; i < m; i ++) scanf("%d", &b[i]);
for (int i = 0; i < n; i ++)
{
int k = x - a[i];
int l = 0, r = m - 1;
while (l < r)
{
int mid = l + r >> 1;
if (b[mid] >= k) r = mid;
else l = mid + 1;
}
if (a[i] + b[l] == x)
{
printf("%d %d\n", i, l);
break;
}
}
return 0;
}
#include <iostream>
#include <cstring>
#include <unordered_map>
using namespace std;
const int N = 100010;
int n, m, x;
int a[N], b[N];
unordered_map<int, int> h;
int main()
{
cin >> n >> m >> x;
for (int i = 0; i < n; i ++ ) cin >> a[i], h[a[i]] = i;
for (int i = 0; i < m; i ++ ) cin >> b[i];
for (int i = 0; i < m; i ++ )
{
if (h.count(x - b[i]))
cout << h[x - b[i]] << ' ' << i << endl;
}
return 0;
}