【題解】Codeforces 1316C. Primitive Primes

#include <iostream>
using namespace std;
 
int n, m, p, a, ans;
 
int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cin >> n >> m >> p;
    for (int i = 0; i < n; i++){
        cin >> a;
        if (a % p != 0){
            ans += i;
            for (int j = i+1; j < n; j++){
                cin >> a;
            }
            break;
        }
    }
    for (int i = 0; i < m; i++){
        cin >> a;
        if (a % p != 0){
            ans += i;
            for (int j = i+1; j < m; j++){
                cin >> a;
            }
            break;
        }
    }
    cout << ans << "\n";
}