<｜begin▁of▁sentence｜>### Instruction:
Given parameters n=5 (number of nodes), m=3 (number of attributes), p=[0.5, 0.3, 0.2] (probabilities for connecting nodes to each attribute), and a seed=42 for reproducibility, can you generate a general random intersection graph and print its edges using NetworkX?
### Response:
import networkx as nx
from networkx.generators.intersection import general_random_intersection_graph

# Parameters
n = 5  # Number of nodes
m = 3  # Number of attributes
p = [0.5, 0.3, 0.2]  # Probabilities for connecting nodes to each attribute

# Seed for reproducibility
seed = 42

# Generate the random intersection graph
G = general_random_intersection_graph(n, m, p, seed=seed)

# Print the edges of the graph
print('Edges of the random intersection graph:', G.edges())
<|EOT|>
