#include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
const int INF=1e9,MOD=1e9+7,ohara=1e6+10;
const ll LINF=1e18;
using namespace std;
    
#define rep(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
#define rrep(i,a,b) for(int i=(a);i<(b);i++)
#define rrrep(i,a,b) for(int i=(a);i>=(b);i--)
#define all(v) (v).begin(), (v).end()
#define Size(n) (n).size()
#define Cout(x) cout<<(x)<<endl
#define doublecout(a) cout<<fixed<<setprecision(15)<<a<<endl;
#define Cerr(x) cerr<<(x)<<endl
#define fi first
#define se second
#define P pair<ll,ll> 
#define m_p make_pair
#define V vector<ll> 
#define U_MAP unordered_map<ll,ll>
#define pq priority_queue<ll>
#define rpq priority_queue<ll,vector<ll>,greater<ll>>
#define p_b push_back
    
ll n,cnt,ans,a,b,c,d,tmp,tmpp,m,h,w,x,y,sum,pos,k;
ld doua;
int dy[]={1,0,-1,0};
int dx[]={0,1,0,-1};
//int dy[]={-1,0,1,-1,1,-1,0,1};
//int dx[]={-1,-1,-1,0,0,1,1,1};
string alph("abcdefghijklmnopqrstuvwxyz"),s;
bool fl;
struct edge{int to,cost;};
int dat[ohara];
    
//-------------------------↓↓↓↓↓↓------------------------
    
//------ 自分を天才だと信じる ------

struct UnionFind{
	std::vector<int> data;
	
	UnionFind(int n){
		data.assign(n,-1);
	}
	
	void unite(int x, int y){
		x=find(x); y=find(y);
		if(x==y) return;
		if(data[x]>data[y]) swap(x,y);
		data[x]+=data[y];
		data[y]=x;
	}
	
	int find(int k){
		if(data[k]<0) return k;
		return data[k]=find(data[k]);
	}
 
	int size(int k) {
		return -data[find(k)];
	}
 
	bool same(int x, int y){
		return find(x)==find(y);
	}
};
    
int main(void){
    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(false);
    
    cin>>n>>m>>k;
    UnionFind uf(ohara);
    rep(i,ohara)dat[i]=-1;
    rep(i,k){
        cin>>a>>b>>c;
        if(a==1){
            if(dat[uf.find(b)]==-1||dat[uf.find(c)]==-1){
                tmp=dat[uf.find(b)];
                tmpp=dat[uf.find(c)];
                dat[uf.find(b)]=-1;
                dat[uf.find(c)]=-1;
                uf.unite(b,c);
                if(tmp!=-1)dat[uf.find(b)]=tmp;
                else dat[uf.find(b)]=tmpp;
            }
            else{
                if(dat[uf.find(b)]!=dat[uf.find(c)]){
                    Cout(i+1);
                    return 0;
                }
                else{
                    tmp=dat[uf.find(b)];
                    dat[uf.find(b)]=-1;
                    uf.unite(b,c);
                    dat[uf.find(b)]=tmp;
                }
            }
        }
        else{
            //if(i==3)Cout(dat[uf.find(b)]);
            if(dat[uf.find(b)]==-1){
                dat[uf.find(b)]=c;
            }
            else{
                //if(i==3)Cout(dat[uf.find(b)]);
                if(dat[uf.find(b)]!=c){
                    Cout(i+1);
                    return 0;
                }
            }
        }
    }
    Cout(0);
    return 0;
}
