1316C - Primitive Primes - CodeForces Solution

#include <bits/stdc++.h>
#define int long long
#define endl "\n"
using namespace std;

typedef pair<int,int> PII;
typedef long long LL;
const int  N = 1000010 , mod = 1e9 + 7,INF = 0x3f3f3f3f;
signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n , m, mod;
    cin >> n >> m >> mod;
    int res = 0, ans = 0;
    for (int i = 1;i <= n; ++ i) 
    {
        int x;
        cin >> x;
        if(x % mod && res == 0) res = i;
    }
    for (int i = 1;i <= m; ++ i)
    {
        int x;
        cin >> x;
        if(x % mod && ans == 0) ans = i;
    }
    cout << res + ans - 2 << endl;
    return 0;
}