1 #include<iostream>
 2 #include<cstdio>
 3 #include<cstdlib>
 4 #include<cstring>
 5 #include<algorithm>
 6 #include<string>
 7 #define maxm 10010
 8 #define inf 0x7f7f7f7f 
 9 using namespace std;
10 int n,m,cnt,sum,mr,tot,rec;
11 struct hh{
12     int u,v,d;
13 }b[maxm*3];
14 int in[maxm],pre[maxm],col[maxm],id[maxm];
15 int zl(int root,int p){
16     rec=0;//一定 ！！！不能！！！！定义到！！！！里面去！！！！！！
17     while (1){
18         for (int i=0;i<=p;++i) in[i]=inf;
19         memset(pre,-1,sizeof(pre));//可能涉及到零 所以每个数组都初始化为-1
20         for (int i=1;i<=cnt;++i){
21             int x=b[i].u,y=b[i].v,z=b[i].d;
22             if (z<in[y]&&x!=y){
23                 pre[y]=x;
24                 in[y]=z;
25                 if (x==root) mr=i;
26             }
27         }
28         tot=0;
29         memset(id,-1,sizeof(id));
30         memset(col,-1,sizeof(col));
31         in[root]=0;
32         for (int i=0;i<=p;++i){
33             rec+=in[i];
34             int j=i;
35             while (j!=root&&col[j]!=i&&id[j]==-1) col[j]=i,j=pre[j];
36             if (j!=root&&id[j]==-1){
37                 for (int q=pre[j];q!=j;q=pre[q]) id[q]=tot;
38                 id[j]=tot++;
39             }
40         }
41         if (tot==0) break;
42         for (int i=0;i<=p;++i) if (id[i]==-1) id[i]=tot++;
43         for (int i=1;i<=cnt;++i){
44             int x=b[i].u,y=b[i].v;
45             b[i].u=id[x];
46             b[i].v=id[y];
47             if (b[i].u!=b[i].v) b[i].d-=in[y];
48         }
49         p=tot-1;
50         root=id[root];
51     }
52     return rec;
53 }
54 int main(){
55     while (scanf ("%d%d",&n,&m)!=EOF){
56         memset(b,-1,sizeof(b));
57         cnt=0,sum=0;
58         for (int i=1;i<=m;++i){
59             int x,y,z;
60             scanf ("%d%d%d",&x,&y,&z);
61             b[++cnt].u=x+1,b[cnt].v=y+1,b[cnt].d=z;
62             sum+=z;
63         }
64         sum++;
65         for (int i=1;i<=n;++i) b[++cnt].u=0,b[cnt].v=i,b[cnt].d=sum;
66         int ans=zl(0,n);
67         if (ans>=2*sum) printf("impossible\n\n");
68         else printf("%d %d\n\n",ans-sum,mr-m-1);
69     }
70     return 0;
71   }